1. Which sorting method did you choose?
2. The sorts we discussed were selection, insertion, bubble, merge, quick, and shell. In about a paragraph, discuss why the ones that you didn’t choose would have been less appropriate?
3. How much slower would you expect bubble sort of 10,000 elements to be than merge sort?
4. What is the fastest algorithm for finding the kth largest element of N numbers?
5. What is the primary disadvantage of Quick Sort? How could this disadvantage be eliminated?
6. What is an advantage of bubble sort over selection sort? What is an advantage of selection sort over bubble sort?
7. Why is a hybrid algorithm combining insertion sort with quick sort often faster than solely using quick sort?
8. Describe how radix sort of integers can be implemented to require only twice memory, rather than ten times memory.
9. State one or two problems that you can think of that are associated with sorting a linked list as compared with arrays?
10. Give one or two advantages that the linked list implementation has over arrays.
Part 3 Implement the program. Turn in the lab, including files containing the typed answers to the part 1 questions, the pseudo-code.
Hints and Instructions
Are you looking for a similar paper or any other quality academic essay? Then look no further. Our research paper writing service is what you require. Our team of experienced writers is on standby to deliver to you an original paper as per your specified instructions with zero plagiarism guaranteed. This is the perfect way you can prepare your own unique academic paper and score the grades you deserve.
Use the order calculator below and get started! Contact our live support team for any assistance or inquiry.
[order_calculator]