2. Lists and Sorting Algorithms Exploring Computer Science – Lesson 2-7

3. Objectives The students will be able to:  Define sorted and unsorted lists.  Describe various sorting algorithms.  Compare various sorting algorithms.

4. Journal Entry  What is the difference between a linear search and a binary search? When is one search method better than another? Give examples. 5 minutes

5. Sorting – The 5 Most Common Methods of Sorting The 5 most common methods a computer might use to sort information are: 1. Selection Sort 2. Quicksort 3. Insertion Sort 4. Bubble Sort 5. Mergesort

6. Sorting – Your Mission…Should You Choose To Accept It Using the internet, do the following for each of the 5 sorting methods: 1. In 2 paragraphs or less of clear, concise and grammatically correct English, describe how that sorting method works. 2. Below the 1-2 paragraphs, list the website or websites you referenced to write your paragraph as a ‘clickable’ link. 3. Below that link or links, draw or paste a diagram that visually exemplifies how that sorting method works. 4. When you have finished describing and referencing the 5 methods, in 2 paragraphs or less, conclude (through comparison and contrast) which method YOU think is the best, in terms of speed.

7. Sorting - Why is this important?  Information is much easier to find in a sorted list. Telephone directories, dictionaries and book indexes all use alphabetical order, and life would be far more difficult if they didn’t. If a list of numbers (such as a list of expenses) is sorted into order, the extreme cases are easy to see because they are at the beginning and end of the list. Duplicates are also easy to find, because they end up together.  Computers spend a lot of their time sorting things into order, so computer scientists have to find fast and efficient ways of doing this.

8. Sorting - Some Points to Remember  Summarize and rephrase  Using original language will earn you points; copying and pasting will earn you a missing.  Proofread  Turning in writing that someone else has read and offered advice on will earn you points; turning in writing that is full of errors and grammatically incorrect will earn you question marks and minimal points.  Remember the format  Your submission must be a Word document. A Google document is unacceptable and will be deleted.  Focus  You must complete at least one third of your paper before leaving class today (That’s Selection Sort and Quicksort.) and send it to me via e-mail. The remainder is homework. You will be given 25 minutes at the start of class on Tuesday to finish, amend or ‘tweak’ your final submission

9. Sorting – Your Presentation/Demo  Assign Roles  Everyone in your group of 3-4 people MUST speak.  Create a Poster  A poster must be created that summarizes and pictures your sort method.  Create a Deck of Cards  A deck of 12 cards must be created, each of which carries one number between 1 and 12. These cards must be used to demonstrate your sorting method.  Focus  This presentation is part of your overall grade for the Sorting Method Research Paper. Do not take it lightly. Remember: EVERYONE in your group must participate in the presentation. Otherwise, a third of your grade will be a zero and make even a C impossible…unless your research paper is perfect. Is that likely? Hmmmm….based on your Tower Building Activity Reflection….I kind of doubt it. Time to step up and make yourself heard.