Reference no: EM133860504

Question

In the world of computers, two non-recursive sorting algorithms are recognized: selection sort and bubble sort. The sequences can be better understood by comparing them, looking at the intricacy of their time and space, and analyzing their pseudocode. A simple sorting technique, bubble sort involves constantly comparing the elements of neighboring arrays and swapping them out if they are out of sequence. The process continues until further swaps are no longer necessary, after which the array is sorted. Choose 2 non-recursive sorting algorithms that you have read about in the text or in the supplemental resources. Discuss (compare and contrast) the time complexities and space complexities of each algorithm. Complete the following: Provide the non-recursive logic (pseudocode) for each algorithm. From the algorithm logic, derive expressions for the "worst case" runtime and space required by the algorithm in terms of n where n is the size of data to be sorted. Specifically, for time complexity, count the number of steps for each line of code, and write down the total lines executed as a mathematical expression t(n) where n is the size of the input array. For space complexity, write an expression for the number of memory locations and components that are required for algorithm in the worst case. Justify your answers: How did you arrive at these expressions?