Quantcast

A community for students. Sign up today!

Here's the question you clicked on:

55 members online
  • 0 replying
  • 0 viewing

agdgdgdgwngo

  • 2 years ago

In real life, what is the fastest way to sort a deck of cards in order?

  • This Question is Closed
  1. notsmart
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 5

    deal them in a line ace to king

  2. agdgdgdgwngo
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    but that's insertion sort :(

  3. satellite73
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    can't wait to see the answer to this!

  4. notsmart
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 5

    im a big card player so thats how i would do it

  5. agdgdgdgwngo
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    yeah I hope someone comes here and gives me a real-life implementation mergesort or quicksort or heapsort or some other fancy sorting algorithm

  6. meverett04
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 1

    I will look into this ...

  7. notsmart
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 5

    you could be a magician

  8. satellite73
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    google? i found a couple, but since i don't understand programming it doesn't help me

  9. agdgdgdgwngo
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    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 :(

  10. Tomas.A
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    bubble sort

  11. JamesJ
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    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.

  12. agdgdgdgwngo
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    Right

  13. agdgdgdgwngo
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    Insertion sort, for small n, is relatively efficient and simple, and therefore effective.

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

    Search OpenStudy
    • Attachments:

Ask your own question

Ask a Question
Find 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
  • 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.

This is the testimonial you wrote.
You haven't written a testimonial for Owlfred.