Presentation is loading. Please wait.

Presentation is loading. Please wait.

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

Published by Modified over 9 years ago

Similar presentations

Presentation on theme: "General Computer Science for Engineers CISC 106 James Atlas Computer and Information Sciences 10/23/2009."— Presentation transcript:

1 General Computer Science for Engineers CISC 106 James Atlas Computer and Information Sciences 10/23/2009

2 Objectives Understand Selection Sort Compare to Quicksort

3 Algorithm for sorting (Selection Sort) 1. Find the minimum data in the set 2. Swap it with the first element of the set 3. Repeat Steps 1-2 for the remaining elements

4 10843125769 1843 25769 1243 85769 1234 85769 1234 85769 123458 769 123456 789 1234567 89 12345678 9 123456789 Running Time (Selection Sort) loop progress

5 Algorithm for sorting (Quick Sort) 1. Choose a random pivot point 2. Split your data into two sets: 1.Low - the data < pivot 2.High - the data > pivot 3. Repeat Steps 1-2 for both data sets 4. The sorted data is [low pivot high]

6 10843125769 184362579 154362789 124365789 124356789 123456789 123456789 Running Time (Quick Sort) recursion progress

7 10843125769 184362579 154362789 124365789 124356889 123458889 123456889 Running Time (Quick Sort) recursion progress If we divide the size of the data, n, in half at each step, how many steps does this take?

8 10843125769 184362579 154362789 124365789 124356889 123458889 123456889 Running Time (Quick Sort) recursion progress If we divide the size of the data, n, in half at each step, how many steps does this take? log n area of table = width * height = n * log n

Download ppt "General Computer Science for Engineers CISC 106 James Atlas Computer and Information Sciences 10/23/2009."

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 14 Recursion Lecture Slides to Accompany An Introduction to Computer Science Using Java (2nd Edition) by S.N. Kamin, D. Mickunas,, E. Reingold.

Chapter 14 Recursion Lecture Slides to Accompany An Introduction to Computer Science Using Java (2nd Edition) by S.N. Kamin, D. Mickunas,, E. Reingold.
QuickSort Example 13, 21, 15, 3, 12, 9, 14, 7, 6 3, 3, 9, 3, 9, 7, 3, 9, 7, 6, First we use the number in the centre of the list as a ‘pivot’. We then.

QuickSort Example 13, 21, 15, 3, 12, 9, 14, 7, 6 3, 3, 9, 3, 9, 7, 3, 9, 7, 6, First we use the number in the centre of the list as a ‘pivot’. We then.
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 Analysis Lecture 6 Quicksort. Quick Sort 88 14 98 25 62 52 79 30 23 31 Divide and Conquer.

Algorithms Analysis Lecture 6 Quicksort. Quick Sort Divide and Conquer.
General Computer Science for Engineers CISC 106 Midterm 2 Review James Atlas Computer and Information Sciences 11/06/2009.

General Computer Science for Engineers CISC 106 Midterm 2 Review James Atlas Computer and Information Sciences 11/06/2009.
Chapter 4: Divide and Conquer Master Theorem, Mergesort, Quicksort, Binary Search, Binary Trees The Design and Analysis of Algorithms.

Chapter 4: Divide and Conquer Master Theorem, Mergesort, Quicksort, Binary Search, Binary Trees The Design and Analysis of Algorithms.
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
Liang, Introduction to Java Programming, Eighth Edition, (c) 2011 Pearson Education, Inc. All rights reserved. 0132130807 1 Chapter 24 Sorting.

Liang, Introduction to Java Programming, Eighth Edition, (c) 2011 Pearson Education, Inc. All rights reserved Chapter 24 Sorting.
Quick Sort 51387462 Elements pivot Data Movement Sorted.

Quick Sort Elements pivot Data Movement Sorted.
Analysis of Quicksort. Quicksort Algorithm Given an array of n elements (e.g., integers): If array only contains one element, return Else –pick one element.

Analysis of Quicksort. Quicksort Algorithm Given an array of n elements (e.g., integers): If array only contains one element, return Else –pick one element.
CSC2100B Quick Sort and Merge Sort Xin 1. Quick Sort Efficient sorting algorithm Example of Divide and Conquer algorithm Two phases ◦ Partition phase.

CSC2100B Quick Sort and Merge Sort Xin 1. Quick Sort Efficient sorting algorithm Example of Divide and Conquer algorithm Two phases ◦ Partition phase.
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.
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.
© 2004 Goodrich, Tamassia Quick-Sort1 7 4 9 6 2  2 4 6 7 9 4 2  2 47 9  7 9 2  29  9.

© 2004 Goodrich, Tamassia Quick-Sort     29  9.
Sorting Algorithms and Average Case Time Complexity

Sorting Algorithms and Average Case Time Complexity
Sorting Algorithms n 2 Sorts ◦Selection Sort ◦Insertion Sort ◦Bubble Sort Better Sorts ◦Merge Sort ◦Quick Sort ◦Radix Sort.

Sorting Algorithms n 2 Sorts ◦Selection Sort ◦Insertion Sort ◦Bubble Sort Better Sorts ◦Merge Sort ◦Quick Sort ◦Radix Sort.
© 2004 Goodrich, Tamassia QuickSort1 Quick-Sort 7 4 9 6 2  2 4 6 7 9 4 2  2 47 9  7 9 2  29  9.

© 2004 Goodrich, Tamassia QuickSort1 Quick-Sort     29  9.
Introduction to Algorithms Rabie A. Ramadan rabieramadan.org 4 Some of the sides are exported from different sources.

Introduction to Algorithms Rabie A. Ramadan rabieramadan.org 4 Some of the sides are exported from different sources.
Quick Sort. Quicksort Quicksort is a well-known sorting algorithm developed by C. A. R. Hoare. The quick sort is an in-place, divide- and-conquer, massively.

Quick Sort. Quicksort Quicksort is a well-known sorting algorithm developed by C. A. R. Hoare. The quick sort is an in-place, divide- and-conquer, massively.

Similar presentations

Ads by Google