A community for students.
Here's the question you clicked on:
 0 viewing
liliy
 3 years ago
which sorting method works fastest:
1.randomized array
2.nearly sorted array
3.reversed
4.array with duplicates
*(assume that it is a large array with like 100,000 numbers)
liliy
 3 years ago
which sorting method works fastest: 1.randomized array 2.nearly sorted array 3.reversed 4.array with duplicates *(assume that it is a large array with like 100,000 numbers)

This Question is Closed

liliy
 3 years ago
Best ResponseYou've already chosen the best response.0no, i think u misunderstood my question. basically i need to do it 4 diff ways and seee hich one is the best for diff methods these are my answers: ranomized:best is: mergesort reverse:bubblesort nearly sorted:bubblesort duplicates: selectionsort

liliy
 3 years ago
Best ResponseYou've already chosen the best response.0if my choices are correct/make sense/ like for a randomized array, it is sorted fastest using mergesort reverse is fastest with bubble...

xaadi1993
 3 years ago
Best ResponseYou've already chosen the best response.0isnt reverse better with insertion sort?

liliy
 3 years ago
Best ResponseYou've already chosen the best response.0oh, ya, but thats not one of my choices.. i have buble sort,mege, selection

xaadi1993
 3 years ago
Best ResponseYou've already chosen the best response.0use merge here because bubble sort will take more steps

bdean20
 3 years ago
Best ResponseYou've already chosen the best response.0Of your choices, merge sort is by far the best. Quicksort is probably the other major alternative to have a look at. A cool one for arrays with only a small range of possible numbers is counting sort: http://en.wikipedia.org/wiki/Counting_sort

jaskiratsingh
 3 years ago
Best ResponseYou've already chosen the best response.2Merge sort and Randomised Quicksort have running times of O(n lg n). Bubble sort and Selection sort is O(n^2) Now O(n lg n) is faster than O( n^2), for a large enough n. Hence, Merge sort and Quicksort beats Bubble and Selection sort. Also, Counting sort has linear running time O(n). So, that's even better that O(n lg n), but it's complex and a little hard to understand.

infinity_
 3 years ago
Best ResponseYou've already chosen the best response.0the url above tells me randomized > merge sort revese > shell sort nearly sorted>insertion sort duplicates > quick sort, but insertion works quite good as well.
Ask your own question
Sign UpFind more explanations on OpenStudy
Your question is ready. Sign up for free to start getting answers.
spraguer
(Moderator)
5
→ View Detailed Profile
is replying to Can someone tell me what button the professor is hitting...
23
 Teamwork 19 Teammate
 Problem Solving 19 Hero
 Engagement 19 Mad Hatter
 You have blocked this person.
 ✔ You're a fan Checking fan status...
Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.