Question

Your mean employer has five sorting programs. But they are labeled by their descriptions - no...

Your mean employer has five sorting programs.

But they are labeled by their descriptions - no names.

Read each label then say which of the following it is:

Heap Sort

Insertion Sort

Merge Sort

Quick Sort

Radix Sort

Selection Sort

1) “I always use theta(n^2) comparisons no matter what kind of list I am sorting. I am ashamed.”

*Answer: This is

2) "I am a good choice if you want to quickly sort a large number of K digit numeric IDs."

*Answer: This is

3) "I am a good choice if you want consistent theta(nlogn) time and you have lots of space."

*Answer: This is

4) "Although I take theta(n^2) time in the worst case, in the best cases

   I only use theta(nlogn) time and I do not need as much space as another recursive algorithm.”

   *Answer: This is

5) "I use theta(nlogn) time in the worst case. The data structure I use is also useful for efficiently

implementing priority queues."

*Answer: This is

6) "Even though my W(n) = theta(n^2) comparisons, I am a good choice if you want to sort small files,

   or large files that are very nearly in order."

*Answer: This is

0 0
Add a comment Improve this question Transcribed image text
Answer #1

1. Selection sort.

2. Radix sort

3. Merge sort

4. Quick sort

5. Heap sort

6. Insertion sort

Add a comment
Know the answer?
Add Answer to:
Your mean employer has five sorting programs. But they are labeled by their descriptions - no...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
  • Part 1: Extend your sorting framework with two advanced sorting methods of your choice: (Shell Sort OR Radix Sort) AND (...

    Part 1: Extend your sorting framework with two advanced sorting methods of your choice: (Shell Sort OR Radix Sort) AND (Merge Sort OR Quick Sort). If you choose Shell Sort, experiment with different incremental sequences to see how they affect the algorithm's run time efficiency (count the number of comparisons and exchanges). If you choose to implement Radix Sort, answer the following question as well: Can you write a version of Radix Sort to work with real numbers? If yes,...

  • Superfast Software Inc. was founded last year by three young programmers. They all dreamed their company...

    Superfast Software Inc. was founded last year by three young programmers. They all dreamed their company would become a really big one and would distribute a large number of software products all over the world. Thus, they decided to use 64-bit integers to represent their inventory codes. Since it is just a one-year-old company, the inventory database now contains only 2000 distinct product codes, in the range from 1 to 3000. At this time they need to sort these codes...

  • Inal Examination 17. Which of the sorting algorithms listed below has the time fastest best case...

    Inal Examination 17. Which of the sorting algorithms listed below has the time fastest best case run (a) Heap sort (b) Merge sort (c) Quick sort (d) Insertion sort 18. Which statement below is false: (a) Quick uick sort and merge sort are divide and conquer algorithte (b) Counting sort is a linear time sorting algorithm. (e) Insertion sort and quicksort have similar best case (d) Generic minimum spanning tree algorithm is 19. Counting sort and radix sort are linked...

  • Problem 5. Superfast Software Inc. was founded last year by three young programmers. They all dreamed...

    Problem 5. Superfast Software Inc. was founded last year by three young programmers. They all dreamed their company would become a really big one and would distribute a large number of software products all over the world. Thus, they decided to use 64-bit integers to represent their inventory codes. Since it is just a one-year-old company, the inventory database now contains only 2000 distinct product codes, in the range from 1 to 3000. At this time they need to sort...

  • Data Structures: For each of the following situations, name the best sorting algorithm we studied. (For...

    Data Structures: For each of the following situations, name the best sorting algorithm we studied. (For one or two questions, there may be more than one answer deserving full credit, but you only need to give one answer for each.) (a) The array is mostly sorted already (a few elements are in the wrong place). (b) You need an O(n log n) sort even in the worst case and you cannot use any extra space except for a few local...

  • Algorithm Analysis: Study the following sorting algorithm.    SORT( A[1...n]) bound <- Length(A) -1 for i...

    Algorithm Analysis: Study the following sorting algorithm.    SORT( A[1...n]) bound <- Length(A) -1 for i <- 1 to Length(A) newbound <- 0 for j <- 0 to bound    if A[j] > A[j + 1]    swap( A[j], A[j + 1] ) newbound = j -1 bound <- newbound (a) Use the longer approach described in lecture 3 week 1 that we used in analyzing Insertion-Sort to compute the running time T(n) of the above SORT algorithm. You may...

  • . Shell sort is a sorting algorithm similar to insertion sort. Research shell sort and apply...

    . Shell sort is a sorting algorithm similar to insertion sort. Research shell sort and apply that to the following array. Show your work in Detail. [15 points] 45 20 50 10 80 30 60 70 40 90 2. Is Shell sort a stable sorting algorithm? Answer this with an example. [10 points] 3. Apply Merge Sort to sort the following list. Show your work in Detail. [15 Points] 45 20 50 10 80 30 60 70 40 90 4....

  • 3. For each of the following situations, name the best sorting algorithm we studied. (For one...

    3. For each of the following situations, name the best sorting algorithm we studied. (For one or two questions, there may be more than one answer deserving full credit, but you only need to give one answer for each.) The array is mostly sorted already (a few elements are in the wrong place). (a) You need an O(n log n) sort even in the worst case and you cannot use any extra space except for a few local variables. (b)...

  • please answer all parts and code thanks . - PART 1-Introduction to Sorting, 21 points Use...

    please answer all parts and code thanks . - PART 1-Introduction to Sorting, 21 points Use this array of integer for the problems 1A, 1B, and 1c: 9 57 8324761 Each of these problems is worth 3 points A. Show the contents of the array each time a selection sort changes it while sorting the array into B. Show the contents of the array each time an insertion sort changes it while sorting C. Show the contents of the array...

  • My tests for sorting algorithms are not working. sorting.py has 6 sorting algorithms and test_sorting.py has...

    My tests for sorting algorithms are not working. sorting.py has 6 sorting algorithms and test_sorting.py has test cases to run those algorithms, but test cases are not working. please correct the errors in test_sorting.py file so that it can test all the sorting algorithms. WARNING: DON'T COPY AND PASTE THE QUESTION IN ANSWER. I WILL REPORT YOU. sorting.py # 1. selection sort # 2. insertion sort # 3. shell sort # 4. heap sort # 5. merge sort # 6....

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT