CST370 Module Seven
CST370 Module Seven Non-Comparison Sorting, Dynamic Programming, Warshall's Algorithm, Floyd's Algorithm, Prim's Algorithm and Greedy Technique What I learned this week: This week we covered a lot of varying algorithms that seemed to all have an underlying theme, where there seemed to be a tradeoff between time complexity and space complexity. Non-Comparison Sorting: We began with covering two different methods of sorting an array of integers without using comparisons among the alloted values. for the Counting Sort Algorithm it's ideal use-case is when the values are in a set range, where the less expensive is most ideal and a more expansive range is less ideal. The main method of sorting would be to keep track of the frequency and distribution of each value in set range. after doing so we can evaluate at each index starting at the end of our initial input array and working backwards, pulling from our distribution array and setting the value at at the distribution arr...