Formative Test 3:

1. Sorting algorithms can be categorised as either divide-and-conquer or brute force in approach. Explain this statement with reference to algorithms representative of both categories.

2. How does Cocktail Sort develop Bubble Sort? What sorting problem does it solve?

3. When analysing algorithms, we often do so with reference to a dominant term or function. What is this?

4. Using pseudo code or a programming language of your choice, specify the algorithm for Shell Sort.

5. With reference to two data structures of your choice, describe what mechanisms they apply to impose hierarchy on to otherwise unstructured data collections.

6. When implementing Quick Sort, what advantages does the method median of three pivot choice have in comparison to random selection?