anonymous
  • anonymous
In real life, what is the fastest way to sort a deck of cards in order?
Mathematics
schrodinger
  • schrodinger
I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!
At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga. Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus. Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.

Get this expert

answer on brainly

SEE EXPERT ANSWER

Get your free account and access expert answers to this
and thousands of other questions

anonymous
  • anonymous
deal them in a line ace to king
anonymous
  • anonymous
but that's insertion sort :(
anonymous
  • anonymous
can't wait to see the answer to this!

Looking for something else?

Not the answer you are looking for? Search for more explanations.

More answers

anonymous
  • anonymous
im a big card player so thats how i would do it
anonymous
  • anonymous
yeah I hope someone comes here and gives me a real-life implementation mergesort or quicksort or heapsort or some other fancy sorting algorithm
anonymous
  • anonymous
I will look into this ...
anonymous
  • anonymous
you could be a magician
anonymous
  • anonymous
google? i found a couple, but since i don't understand programming it doesn't help me
anonymous
  • anonymous
insertion 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 right-to-left 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 :(
anonymous
  • anonymous
bubble sort
JamesJ
  • JamesJ
In 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.
anonymous
  • anonymous
Right
anonymous
  • anonymous
Insertion sort, for small n, is relatively efficient and simple, and therefore effective.

Looking for something else?

Not the answer you are looking for? Search for more explanations.