Presentation is loading. Please wait.

Presentation is loading. Please wait.

COMP 1001: Introduction to Computers for Arts and Social Sciences Sorting Algorithms Wednesday, June 1, 2011.

Published byQuentin Logan Modified over 8 years ago

Similar presentations

Presentation on theme: "COMP 1001: Introduction to Computers for Arts and Social Sciences Sorting Algorithms Wednesday, June 1, 2011."— Presentation transcript:

1 COMP 1001: Introduction to Computers for Arts and Social Sciences Sorting Algorithms Wednesday, June 1, 2011

2 COMP 1001: Introduction to Computers for Arts and Social Sciences How do you sort when you can only compare two things?

3 COMP 1001: Introduction to Computers for Arts and Social Sciences Sorting Demo http://gailcarmichael.com/processing /bottlesort/

4 COMP 1001: Introduction to Computers for Arts and Social Sciences Sort Part One: – Find the lightest bottle using the scale – What is the easiest way to do this?

5 COMP 1001: Introduction to Computers for Arts and Social Sciences Sort Part Two: – Choose three bottles at random – Sort them using the scale – What is the fewest number of comparisons you can do?

6 COMP 1001: Introduction to Computers for Arts and Social Sciences Sort Part Three: – Sort all the bottles from lightest to heaviest by repeatedly finding the lightest bottle that’s left, and moving it into the sorted list at the top – This is known as Selection Sort

7 COMP 1001: Introduction to Computers for Arts and Social Sciences Selection Sort Dance http://www.youtube.com/watch?v= Ns4TPTC8whw

8 COMP 1001: Introduction to Computers for Arts and Social Sciences Selection Sort Demo http://www.sorting- algorithms.com/selection-sort

9 COMP 1001: Introduction to Computers for Arts and Social Sciences Selection Sort Demo (II) http://www.cosc.canterbury.ac.nz/m ukundan/dsal/SSort.html

10 COMP 1001: Introduction to Computers for Arts and Social Sciences Insertion Sort Take the next item in the unsorted list Insert it into the correct location in the sorted list – Do this by comparing the new item with each of the existing items until the correct place is found

11 COMP 1001: Introduction to Computers for Arts and Social Sciences Insertion Sort Dance http://www.youtube.com/watch?v=R OalU379l3U

12 COMP 1001: Introduction to Computers for Arts and Social Sciences Insertion Sort Demo http://www.sorting- algorithms.com/insertion-sort

13 COMP 1001: Introduction to Computers for Arts and Social Sciences Quick Sort

14 COMP 1001: Introduction to Computers for Arts and Social Sciences Quick Sort Demo http://www.sorting- algorithms.com/quick-sort

15 COMP 1001: Introduction to Computers for Arts and Social Sciences Quicksort Demo (II) http://www.cosc.canterbury.ac.nz/m ukundan/dsal/QSort.html

16 COMP 1001: Introduction to Computers for Arts and Social Sciences Quicksorting a Stack of Graded Papers http://www.youtube.com/watch?v=F Syr8o8jjwM

17 COMP 1001: Introduction to Computers for Arts and Social Sciences Efficiency Which sorting algorithm should be fastest in most cases? What would happen to quicksort if you picked the lightest bottle to arrange around each time?

18 COMP 1001: Introduction to Computers for Arts and Social Sciences Selection Sort vs. Quicksort http://www.youtube.com/watch?v=c VMKXKoGu_Y

Download ppt "COMP 1001: Introduction to Computers for Arts and Social Sciences Sorting Algorithms Wednesday, June 1, 2011."

Similar presentations

Order of complexity. Consider four algorithms 1.The naïve way of adding the numbers up to n 2.The smart way of adding the numbers up to n 3.A binary search.

Order of complexity. Consider four algorithms 1.The naïve way of adding the numbers up to n 2.The smart way of adding the numbers up to n 3.A binary search.
Chapter 7 Sorting Part II. 7.3 QUICK SORT Example 4151264 left right pivot i j 5 > pivot and should go to the other side. 2 < pivot and should go to.

Chapter 7 Sorting Part II. 7.3 QUICK SORT Example left right pivot i j 5 > pivot and should go to the other side. 2 < pivot and should go to.
Algorithms (continued)

Algorithms (continued)
Computer Science 112 Fundamentals of Programming II Bucket Sort: An O(N) Sort Algorithm.

Computer Science 112 Fundamentals of Programming II Bucket Sort: An O(N) Sort Algorithm.
Jyotishka Datta STAT 598Z – Sorting. Insertion Sort If the first few objects are already sorted, an unsorted object can be inserted in the sorted set.

Jyotishka Datta STAT 598Z – Sorting. Insertion Sort If the first few objects are already sorted, an unsorted object can be inserted in the sorted set.
Sorting A fundamental operation in computer science (many programs need to sort as an intermediate step). Many sorting algorithms have been developed Choose.

Sorting A fundamental operation in computer science (many programs need to sort as an intermediate step). Many sorting algorithms have been developed Choose.
Quicksort CSE 331 Section 2 James Daly. Review: Merge Sort Basic idea: split the list into two parts, sort both parts, then merge the two lists 11324262152728.

Quicksort CSE 331 Section 2 James Daly. Review: Merge Sort Basic idea: split the list into two parts, sort both parts, then merge the two lists
Quicksort CS 3358 Data Structures. Sorting II/ Slide 2 Introduction Fastest known sorting algorithm in practice * Average case: O(N log N) * Worst case:

Quicksort CS 3358 Data Structures. Sorting II/ Slide 2 Introduction Fastest known sorting algorithm in practice * Average case: O(N log N) * Worst case:
CS 206 Introduction to Computer Science II 04 / 28 / 2009 Instructor: Michael Eckmann.

CS 206 Introduction to Computer Science II 04 / 28 / 2009 Instructor: Michael Eckmann.
25 May 20151 Quick Sort (11.2) CSE 2011 Winter 2011.

25 May Quick Sort (11.2) CSE 2011 Winter 2011.
Quicksort COMP171 Fall 2005. Sorting II/ Slide 2 Introduction * Fastest known sorting algorithm in practice * Average case: O(N log N) * Worst case: O(N.

Quicksort COMP171 Fall Sorting II/ Slide 2 Introduction * Fastest known sorting algorithm in practice * Average case: O(N log N) * Worst case: O(N.
Data Structures Data Structures Topic #13. Today’s Agenda Sorting Algorithms: Recursive –mergesort –quicksort As we learn about each sorting algorithm,

Data Structures Data Structures Topic #13. Today’s Agenda Sorting Algorithms: Recursive –mergesort –quicksort As we learn about each sorting algorithm,
CPSC 171 Introduction to Computer Science More Efficiency of Algorithms.

CPSC 171 Introduction to Computer Science More Efficiency of Algorithms.
Sorting Chapter 9.

Sorting Chapter 9.
Algorithm An algorithm is a step-by-step set of operations to be performed. Real-life example: a recipe Computer science example: determining the mode.

Algorithm An algorithm is a step-by-step set of operations to be performed. Real-life example: a recipe Computer science example: determining the mode.
CS 206 Introduction to Computer Science II 12 / 09 / 2009 Instructor: Michael Eckmann.

CS 206 Introduction to Computer Science II 12 / 09 / 2009 Instructor: Michael Eckmann.
General Computer Science for Engineers CISC 106 James Atlas Computer and Information Sciences 10/23/2009.

General Computer Science for Engineers CISC 106 James Atlas Computer and Information Sciences 10/23/2009.
CHAPTER 11 Sorting.

CHAPTER 11 Sorting.
Objectives Learn how to implement the sequential search algorithm Explore how to sort an array using the selection sort algorithm Learn how to implement.

Objectives Learn how to implement the sequential search algorithm Explore how to sort an array using the selection sort algorithm Learn how to implement.
Sorting Chapter 6. 2 Algorithms to know Insertion Sort Insertion Sort –O(n 2 ) but very efficient on partially sorted lists. Quicksort Quicksort –O(n.

Sorting Chapter 6. 2 Algorithms to know Insertion Sort Insertion Sort –O(n 2 ) but very efficient on partially sorted lists. Quicksort Quicksort –O(n.

Similar presentations

Ads by Google