Presentation is loading. Please wait.

Presentation is loading. Please wait.

Copyright © 1999, Carnegie Mellon. All Rights Reserved. Chapter 12 presents several common algorithms for sorting an array of integers. Two slow but simple.

Published by Modified over 8 years ago

Similar presentations

Presentation on theme: "Copyright © 1999, Carnegie Mellon. All Rights Reserved. Chapter 12 presents several common algorithms for sorting an array of integers. Two slow but simple."— Presentation transcript:

1 Copyright © 1999, Carnegie Mellon. All Rights Reserved. Chapter 12 presents several common algorithms for sorting an array of integers. Two slow but simple algorithms are Selectionsort and Insertionsort. This presentation demonstrates how the two algorithms work. Quadratic Sorting Data Structures and Other Objects Using Java

2 Copyright © 1999, Carnegie Mellon. All Rights Reserved. Sorting an Array of Integers The picture shows an array of six integers that we want to sort from smallest to largest [0] [1] [2] [3] [4] [5]

3 Copyright © 1999, Carnegie Mellon. All Rights Reserved. The Selectionsort Algorithm Start by finding the smallest entry. [0] [1] [2] [3] [4] [5]

4 Copyright © 1999, Carnegie Mellon. All Rights Reserved. The Selectionsort Algorithm Start by finding the smallest entry. Swap the smallest entry with the first entry. [0] [1] [2] [3] [4] [5]

5 Copyright © 1999, Carnegie Mellon. All Rights Reserved. The Selectionsort Algorithm Start by finding the smallest entry. Swap the smallest entry with the first entry. [0] [1] [2] [3] [4] [5]

6 Copyright © 1999, Carnegie Mellon. All Rights Reserved. The Selectionsort Algorithm Part of the array is now sorted. Sorted side Unsorted side [0] [1] [2] [3] [4] [5]

7 Copyright © 1999, Carnegie Mellon. All Rights Reserved. The Selectionsort Algorithm Find the smallest element in the unsorted side. Sorted side Unsorted side [0] [1] [2] [3] [4] [5]

8 Copyright © 1999, Carnegie Mellon. All Rights Reserved. The Selectionsort Algorithm Find the smallest element in the unsorted side. Swap with the front of the unsorted side. Sorted side Unsorted side [0] [1] [2] [3] [4] [5]

9 Copyright © 1999, Carnegie Mellon. All Rights Reserved. The Selectionsort Algorithm We have increased the size of the sorted side by one element. Sorted side Unsorted side [0] [1] [2] [3] [4] [5]

10 Copyright © 1999, Carnegie Mellon. All Rights Reserved. The Selectionsort Algorithm The process continues... Sorted side Unsorted side Smallest from unsorted Smallest from unsorted [0] [1] [2] [3] [4] [5]

11 Copyright © 1999, Carnegie Mellon. All Rights Reserved. The Selectionsort Algorithm The process continues... Sorted side Unsorted side [0] [1] [2] [3] [4] [5] Swap with front Swap with front

12 Copyright © 1999, Carnegie Mellon. All Rights Reserved. The Selectionsort Algorithm The process continues... Sorted side Unsorted side Sorted side is bigger Sorted side is bigger [0] [1] [2] [3] [4] [5]

13 Copyright © 1999, Carnegie Mellon. All Rights Reserved. The Selectionsort Algorithm The process keeps adding one more number to the sorted side. The sorted side has the smallest numbers, arranged from small to large. Sorted side Unsorted side [0] [1] [2] [3] [4] [5]

14 Copyright © 1999, Carnegie Mellon. All Rights Reserved. The Selectionsort Algorithm We can stop when the unsorted side has just one number, since that number must be the largest number. [0] [1] [2] [3] [4] [5] Sorted side Unsorted side

15 Copyright © 1999, Carnegie Mellon. All Rights Reserved. The Selectionsort Algorithm The array is now sorted. We repeatedly selected the smallest element, and moved this element to the front of the unsorted side. [0] [1] [2] [3] [4] [5]

16 Copyright © 1999, Carnegie Mellon. All Rights Reserved. The Insertionsort Algorithm The Insertionsort algorithm also views the array as having a sorted side and an unsorted side. [0] [1] [2] [3] [4] [5]

17 Copyright © 1999, Carnegie Mellon. All Rights Reserved. The Insertionsort Algorithm The sorted side starts with just the first element, which is not necessarily the smallest element. [0] [1] [2] [3] [4] [5] Sorted side Unsorted side

18 Copyright © 1999, Carnegie Mellon. All Rights Reserved. The Insertionsort Algorithm The sorted side grows by taking the front element from the unsorted side... [0] [1] [2] [3] [4] [5] Sorted side Unsorted side

19 Copyright © 1999, Carnegie Mellon. All Rights Reserved. The Insertionsort Algorithm...and inserting it in the place that keeps the sorted side arranged from small to large. [0] [1] [2] [3] [4] [5] Sorted side Unsorted side

20 Copyright © 1999, Carnegie Mellon. All Rights Reserved. The Insertionsort Algorithm In this example, the new element goes in front of the element that was already in the sorted side. [0] [1] [2] [3] [4] [5] Sorted side Unsorted side

21 Copyright © 1999, Carnegie Mellon. All Rights Reserved. The Insertionsort Algorithm Sometimes we are lucky and the new inserted item doesn't need to move at all. [0] [1] [2] [3] [4] [5] Sorted side Unsorted side

22 Copyright © 1999, Carnegie Mellon. All Rights Reserved. The Insertionsort Algorithm Sometimes we are lucky twice in a row. [0] [1] [2] [3] [4] [5] Sorted side Unsorted side

23 Copyright © 1999, Carnegie Mellon. All Rights Reserved. How to Insert One Element ¶Copy the new element to a separate location. [0] [1] [2] [3] [4] [5] Sorted side Unsorted side

24 Copyright © 1999, Carnegie Mellon. All Rights Reserved. How to Insert One Element ·Shift elements in the sorted side, creating an open space for the new element. [0] [1] [2] [3] [4] [5]

25 Copyright © 1999, Carnegie Mellon. All Rights Reserved. How to Insert One Element ·Shift elements in the sorted side, creating an open space for the new element. [0] [1] [2] [3] [4] [5]

26 Copyright © 1999, Carnegie Mellon. All Rights Reserved. How to Insert One Element ·Continue shifting elements... [0] [1] [2] [3] [4] [5]

27 Copyright © 1999, Carnegie Mellon. All Rights Reserved. How to Insert One Element ·Continue shifting elements... [0] [1] [2] [3] [4] [5]

28 Copyright © 1999, Carnegie Mellon. All Rights Reserved. How to Insert One Element ·...until you reach the location for the new element. [0] [1] [2] [3] [4] [5]

29 Copyright © 1999, Carnegie Mellon. All Rights Reserved. How to Insert One Element ¸Copy the new element back into the array, at the correct location. [0] [1] [2] [3] [4] [5] Sorted side Unsorted side

30 Copyright © 1999, Carnegie Mellon. All Rights Reserved. How to Insert One Element The last element must also be inserted. Start by copying it... [0] [1] [2] [3] [4] [5] Sorted side Unsorted side

31 Copyright © 1999, Carnegie Mellon. All Rights Reserved. A Quiz How many shifts will occur before we copy this element back into the array? [0] [1] [2] [3] [4] [5]

32 Copyright © 1999, Carnegie Mellon. All Rights Reserved. A Quiz Four items are shifted. [0] [1] [2] [3] [4] [5]

33 Copyright © 1999, Carnegie Mellon. All Rights Reserved. A Quiz Four items are shifted. And then the element is copied back into the array. [0] [1] [2] [3] [4] [5]

34 Copyright © 1999, Carnegie Mellon. All Rights Reserved. Both Selectionsort and Insertionsort have a worst-case time of O(n 2 ), making them impractical for large arrays. But they are easy to program, easy to debug. Insertionsort also has good performance when the array is nearly sorted to begin with. But more sophisticated sorting algorithms are needed when good performance is needed in all cases for large arrays. Timing and Other Issues

35 Copyright © 1999, Carnegie Mellon. All Rights Reserved. T HE E ND Presentation copyright 1999 Addison Wesley Longman, For use with Data Structures and Other Objects Using Java by Michael Main. Some artwork in the presentation is used with permission from Presentation Task Force (copyright New Vision Technologies Inc) and Corel Gallery Clipart Catalog (copyright Corel Corporation, 3G Graphics Inc, Archive Arts, Cartesia Software, Image Club Graphics Inc, One Mile Up Inc, TechPool Studios, Totem Graphics Inc). Students and instructors who use Data Structures and Other Objects Using Java are welcome to use this presentation however they see fit, so long as this copyright notice remains intact.

Download ppt "Copyright © 1999, Carnegie Mellon. All Rights Reserved. Chapter 12 presents several common algorithms for sorting an array of integers. Two slow but simple."

Similar presentations

P p Two slow but simple algorithms are Selectionsort and Insertionsort. p p This presentation demonstrates how the two algorithms work. Quadratic Sorting.

P p Two slow but simple algorithms are Selectionsort and Insertionsort. p p This presentation demonstrates how the two algorithms work. Quadratic Sorting.
Chapter 5 introduces the often- used data structure of linked lists. This presentation shows how to implement the most common operations on linked lists.

Chapter 5 introduces the often- used data structure of linked lists. This presentation shows how to implement the most common operations on linked lists.
CSC211 Data Structures Lecture 9 Linked Lists Instructor: Prof. Xiaoyan Li Department of Computer Science Mount Holyoke College.

CSC211 Data Structures Lecture 9 Linked Lists Instructor: Prof. Xiaoyan Li Department of Computer Science Mount Holyoke College.
Chapter 12 discusses several ways of storing information in an array, and later searching for the information. Hash tables are a common approach to the.

Chapter 12 discusses several ways of storing information in an array, and later searching for the information. Hash tables are a common approach to the.
Chapter 8 introduces the technique of recursive programming. As you have seen, recursive programming involves spotting smaller occurrences of a problem.

Chapter 8 introduces the technique of recursive programming. As you have seen, recursive programming involves spotting smaller occurrences of a problem.
Container Classes A container class is a data type that is capable of holding a collection of items. In C++, container classes can be implemented as.

Container Classes A container class is a data type that is capable of holding a collection of items. In C++, container classes can be implemented as.
L l One of the tree applications in Chapter 9 is binary search trees. l l In Chapter 9, binary search trees are used to implement bags and sets. l l This.

L l One of the tree applications in Chapter 9 is binary search trees. l l In Chapter 9, binary search trees are used to implement bags and sets. l l This.
 One of the tree applications in Chapter 10 is binary search trees.  In Chapter 10, binary search trees are used to implement bags and sets.  This presentation.

 One of the tree applications in Chapter 10 is binary search trees.  In Chapter 10, binary search trees are used to implement bags and sets.  This presentation.
CSC212 Data Structure Lecture 14 Binary Search Trees Instructor: Prof. George Wolberg Department of Computer Science City College of New York.

CSC212 Data Structure Lecture 14 Binary Search Trees Instructor: Prof. George Wolberg Department of Computer Science City College of New York.
 Chapter 11 has several programming projects, including a project that uses heaps.  This presentation shows you what a heap is, and demonstrates two.

 Chapter 11 has several programming projects, including a project that uses heaps.  This presentation shows you what a heap is, and demonstrates two.
CSC212 Data Structure - Section AB Lecture 20 Hashing Instructor: Edgardo Molina Department of Computer Science City College of New York.

CSC212 Data Structure - Section AB Lecture 20 Hashing Instructor: Edgardo Molina Department of Computer Science City College of New York.
 Chapter 7 introduces the stack data type.  Several example applications of stacks are given in that chapter.  This presentation shows another use called.

 Chapter 7 introduces the stack data type.  Several example applications of stacks are given in that chapter.  This presentation shows another use called.
P Chapter 6 introduces the stack data type. p Several example applications of stacks are given in that chapter. p This presentation shows another use called.

P Chapter 6 introduces the stack data type. p Several example applications of stacks are given in that chapter. p This presentation shows another use called.
Sorting I Chapter 8 Kruse and Ryba. Introduction Common problem: sort a list of values, starting from lowest to highest. –List of exam scores –Words of.

Sorting I Chapter 8 Kruse and Ryba. Introduction Common problem: sort a list of values, starting from lowest to highest. –List of exam scores –Words of.
  Chapter 12 presents several common algorithms for sorting an array of integers.   Two slow but simple algorithms are Selectionsort and Insertionsort.

  Chapter 12 presents several common algorithms for sorting an array of integers.   Two slow but simple algorithms are Selectionsort and Insertionsort.
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.
 Sort: arrange values into an order  Alphabetical  Ascending numeric  Descending numeric  Does come before or after “%”?  Two algorithms considered.

 Sort: arrange values into an order  Alphabetical  Ascending numeric  Descending numeric  Does come before or after “%”?  Two algorithms considered.
Arrays part 2 Applications & such. Returning an array from a method A method can return an array, just like it can return any other kind of variable;

Arrays part 2 Applications & such. Returning an array from a method A method can return an array, just like it can return any other kind of variable;
P p Chapter 10 has several programming projects, including a project that uses heaps. p p This presentation shows you what a heap is, and demonstrates.

P p Chapter 10 has several programming projects, including a project that uses heaps. p p This presentation shows you what a heap is, and demonstrates.
Sorting1 Sorting Order in the court!. sorting2 Importance of sorting Sorting a list of values is a fundamental task of computers - this task is one of.

Sorting1 Sorting Order in the court!. sorting2 Importance of sorting Sorting a list of values is a fundamental task of computers - this task is one of.

Similar presentations

Ads by Google