How can we best use arrays? Where can we use linked-lists (some examples maybe?)? Why analysis of algorithms is necessary before even executing your program.

If the numbers in our list were not unique and therefore the largest number could occur more than once, would the algorithm find the first occurrence?

I need to write an algorithm pseudocode that sorts a list of n elements in non-increasing order by finding the largest and smallest elements and exchanging those elements with the elements in the first and last positions. Then the size of the list is reduced by 2, excluding the two elements that are already in the proper positions, and the process is repeated on the remaining part of the list until the entire list is sorted. I also need to analyze the algorithm and show the results using order notation. I was trying to use arguments but I got stuck.

Compare the sorting times of the insertion sort with QuickSort using a small array (less than 20). What is the time difference? Could you explain why?