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

This Question is Closed

notsmart
 3 years ago
Best ResponseYou've already chosen the best response.5deal them in a line ace to king

agdgdgdgwngo
 3 years ago
Best ResponseYou've already chosen the best response.0but that's insertion sort :(

satellite73
 3 years ago
Best ResponseYou've already chosen the best response.0can't wait to see the answer to this!

notsmart
 3 years ago
Best ResponseYou've already chosen the best response.5im a big card player so thats how i would do it

agdgdgdgwngo
 3 years ago
Best ResponseYou've already chosen the best response.0yeah I hope someone comes here and gives me a reallife implementation mergesort or quicksort or heapsort or some other fancy sorting algorithm

meverett04
 3 years ago
Best ResponseYou've already chosen the best response.1I will look into this ...

notsmart
 3 years ago
Best ResponseYou've already chosen the best response.5you could be a magician

satellite73
 3 years ago
Best ResponseYou've already chosen the best response.0google? i found a couple, but since i don't understand programming it doesn't help me

agdgdgdgwngo
 3 years ago
Best ResponseYou've already chosen the best response.0insertion sort works something like this: table: empty hand: unsorted cards put the first card of the deck on the table the top card of the deck is now your key put it in it's appropriate position on the table, comparing it to the single card on the table now the next card is the key compare it righttoleft with the cards on the table, placing it in it's appropriate position on the table (i.e. just after a card that's smaller than it) ... in the end you have a line of sorted cards on the table, so all you do is bundle them up :D Insertion sort is O(n^2) though :(

JamesJ
 3 years ago
Best ResponseYou've already chosen the best response.0In real life agd, you wouldn't write a computer program to do it anyway, but do it by hand. What notsmart said sounds smart to me.

agdgdgdgwngo
 3 years ago
Best ResponseYou've already chosen the best response.0Insertion sort, for small n, is relatively efficient and simple, and therefore effective.
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.