A community for students. Sign up today!
Here's the question you clicked on:
 0 viewing

This Question is Closed

agdgdgdgwngo
 2 years ago
Best ResponseYou've already chosen the best response.3It works by passing through the the sequence n1 times, working its way up the sequence. In each pass, it looks for the smallest element in the sequence (say I'm sorting in ascending order), storing it in a register. Once the pass is complete, it swaps the smallest element with the element in the current index and moves on.

agdgdgdgwngo
 2 years ago
Best ResponseYou've already chosen the best response.3http://www.youtube.com/watch?v=t8giYGHpEA selection sort is in there

Neeraj_OCW
 2 years ago
Best ResponseYou've already chosen the best response.2Click on the green icon on topleft of this page http://www.sortingalgorithms.com/selectionsort It'll start visualizing the lines below which describes the how sorting is going on. There are also other visualizations for diff. alogs.

dexter4life
 2 years ago
Best ResponseYou've already chosen the best response.0Base on the O(n). Where does the selection sort falls. Is it O(nlogn) or ?

dexter4life
 2 years ago
Best ResponseYou've already chosen the best response.0Please some body explain this for me > O(nLogn).

Neeraj_OCW
 2 years ago
Best ResponseYou've already chosen the best response.2Ok, i asked this question a few back on CS.SE, it's better you have a look at all answers there than i explain http://cs.stackexchange.com/questions/192/howtocomeupwiththeruntimeofalgorithms

agdgdgdgwngo
 2 years ago
Best ResponseYou've already chosen the best response.3Actually, selection sort is \(O\left(n^2\right)\)
Ask your own question
Ask a QuestionFind 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.