1 / 27

Introductory Algorithms

Introductory Algorithms. Lecture 01: Sorting Algorithms April 8 th , 2009 Jonathan Tse. Overview – Sorting Activity – Post Sort Discussion – Sorting Algorithms – Wrap Up. Sort Playing Cards. Sorting Order Sort into Suits Clubs, Diamonds, Hearts, Spades Sort Suits

hastin
Télécharger la présentation

Introductory Algorithms

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Introductory Algorithms Lecture 01: Sorting Algorithms April 8th, 2009 Jonathan Tse Overview – Sorting Activity – Post Sort Discussion – Sorting Algorithms – Wrap Up

  2. Sort Playing Cards • Sorting Order • Sort into Suits • Clubs, Diamonds, Hearts, Spades • Sort Suits • A 2 3 4 5 6 7 8 9 10 J Q K • Rules Overview – Sorting Activity – Post Sort Discussion – Sorting Algorithms – Wrap Up

  3. Post-Sort Discussion • What was different about how you sorted? • Which way was harder/more time consuming? • Which way took up more physical space? • Was one way clearly better than another? • Was one way better in a given situation? Overview – Sorting Activity – Post Sort Discussion – Sorting Algorithms – Wrap Up

  4. Post-Sort Discussion • Moving 1 Card == 1 Processor Action • Memory Space == Physical Space • Tradeoff Between: • Number of Processor Actions • Memory Space Used Overview – Sorting Activity – Post Sort Discussion – Sorting Algorithms – Wrap Up

  5. Insertion Sort Working Space 23 17 45 18 12 22 Array Space Overview – Sorting Activity – Post Sort Discussion – Sorting Algorithms – Wrap Up

  6. Insertion Sort 23 23 Working Space 17 45 18 12 22 Array Space Overview – Sorting Activity – Post Sort Discussion – Sorting Algorithms – Wrap Up

  7. Insertion Sort Working Space 17 23 23 23 45 18 12 22 Array Space Overview – Sorting Activity – Post Sort Discussion – Sorting Algorithms – Wrap Up

  8. Insertion Sort Working Space 45 45 17 23 18 12 22 Array Space Overview – Sorting Activity – Post Sort Discussion – Sorting Algorithms – Wrap Up

  9. Insertion Sort Working Space 18 17 23 23 45 23 45 12 22 Array Space Overview – Sorting Activity – Post Sort Discussion – Sorting Algorithms – Wrap Up

  10. Insertion Sort Working Space 12 17 17 17 18 23 18 23 45 45 22 Array Space Overview – Sorting Activity – Post Sort Discussion – Sorting Algorithms – Wrap Up

  11. Insertion Sort Working Space 22 12 17 18 23 23 45 23 45 Array Space Overview – Sorting Activity – Post Sort Discussion – Sorting Algorithms – Wrap Up

  12. Insertion Sort Done! 12 17 18 22 23 45 Overview – Sorting Activity – Post Sort Discussion – Sorting Algorithms – Wrap Up

  13. Selection Sort Working Space 23 17 45 18 12 22 Array Space Overview – Sorting Activity – Post Sort Discussion – Sorting Algorithms – Wrap Up

  14. Selection Sort Working Space 23 12 17 45 18 12 22 Array Space Overview – Sorting Activity – Post Sort Discussion – Sorting Algorithms – Wrap Up

  15. Selection Sort Working Space 17 17 12 45 18 23 22 Array Space Overview – Sorting Activity – Post Sort Discussion – Sorting Algorithms – Wrap Up

  16. Selection Sort Working Space 45 18 12 17 23 22 Array Space 18 Overview – Sorting Activity – Post Sort Discussion – Sorting Algorithms – Wrap Up

  17. Selection Sort Working Space 45 22 12 17 18 23 22 Array Space Overview – Sorting Activity – Post Sort Discussion – Sorting Algorithms – Wrap Up

  18. Selection Sort Working Space 23 23 12 17 18 22 45 Array Space Overview – Sorting Activity – Post Sort Discussion – Sorting Algorithms – Wrap Up

  19. Selection Sort Working Space 45 45 12 17 18 22 23 Array Space Overview – Sorting Activity – Post Sort Discussion – Sorting Algorithms – Wrap Up

  20. Selection Sort Done! 12 17 18 22 23 45 Overview – Sorting Activity – Post Sort Discussion – Sorting Algorithms – Wrap Up

  21. Merge Sort Array Space Working Space Overview – Sorting Activity – Post Sort Discussion – Sorting Algorithms – Wrap Up

  22. Merge Sort Array Space Working Space Done! Overview – Sorting Activity – Post Sort Discussion – Sorting Algorithms – Wrap Up

  23. Radix Sort 12 17 18 22 23 12 22 37 23 36 Done! 45 Working Space 45 36 17 37 18 Array Space 12 23 17 17 18 45 18 22 23 12 22 36 37 37 36 45 Overview – Sorting Activity – Post Sort Discussion – Sorting Algorithms – Wrap Up

  24. Summary of Sorting Algorithms • Insertion Sort • Selection Sort • Merge Sort • Radix Sort Overview – Sorting Activity – Post Sort Discussion – Sorting Algorithms– Wrap Up

  25. Wrap-Up • Was there anything in particular you noticed about the algorithms? • Is one better than the other? • In what situation is one better than the other? • How do we objectively compare these algorithms? Overview – Sorting Activity – Post Sort Discussion – Sorting Algorithms – Wrap Up

  26. Wrap Up • Is there some comparison metric? • Can we quantify memory usage? • What about execution time? • Does the list to be sorted affect anything? • Is there a worst case? Overview – Sorting Activity – Post Sort Discussion – Sorting Algorithms – Wrap Up

  27. Next Time • Standard Metrics for Algorithm Performance • Worst Case Analysis Overview – Sorting Activity – Post Sort Discussion – Sorting Algorithms – Wrap Up

More Related