SlideShare a Scribd company logo

DSSchapt13.ppt

Download as PPT, PDF
Safia Kanwal, profile picture
Safia Kanwal

The document presents the selection sort and insertion sort algorithms. It demonstrates how selection sort works by repeatedly finding the smallest element in the unsorted portion of the array and swapping it into the sorted portion. It also shows how insertion sort inserts one element at a time into the sorted portion by shifting larger elements to make room. Both algorithms view the array as having a sorted portion that grows gradually as elements are added from the unsorted portion.

Small Business & Entrepreneurship
1 of 35
Download to read offline
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
 Chapter 13 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 C++
Sorting an Array of Integers  The picture shows an array of six integers that we want to sort from smallest to largest [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] [0] [1] [2] [3] [4] [5]
[1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] The Selectionsort Algorithm  Start by finding the smallest entry. [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] [0] [1] [2] [3] [4] [5]
[1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] The Selectionsort Algorithm  Start by finding the smallest entry.  Swap the smallest entry with the first entry. [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] [0] [1] [2] [3] [4] [5]
[1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] The Selectionsort Algorithm  Start by finding the smallest entry.  Swap the smallest entry with the first entry. [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] [0] [1] [2] [3] [4] [5]
[1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] The Selectionsort Algorithm  Part of the array is now sorted. [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] Sorted side Unsorted side [0] [1] [2] [3] [4] [5]
[1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] The Selectionsort Algorithm  Find the smallest element in the unsorted side. Sorted side Unsorted side [0] [1] [2] [3] [4] [5]
[1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] 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]
[1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] 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]
[1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] The Selectionsort Algorithm  The process continues... Sorted side Unsorted side Smallest from unsorted [0] [1] [2] [3] [4] [5]
[1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] The Selectionsort Algorithm  The process continues... Sorted side Unsorted side [0] [1] [2] [3] [4] [5]
[1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] The Selectionsort Algorithm  The process continues... Sorted side Unsorted side Sorted side is bigger [0] [1] [2] [3] [4] [5]
[1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] 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]
[1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] 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 sid
[1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] 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]
[1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] 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]
[1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] The Insertionsort Algorithm  The sorted side starts with just the first element, which is not necessarily the smallest element. [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] [0] [1] [2] [3] [4] [5] Sorted side Unsorted side
[1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] The Insertionsort Algorithm  The sorted side grows by taking the front element from the unsorted side... [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] [0] [1] [2] [3] [4] [5] Sorted side Unsorted side
[1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] The Insertionsort Algorithm  ...and inserting it in the place that keeps the sorted side arranged from small to large. [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] [0] [1] [2] [3] [4] [5] Sorted side Unsorted side
[1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] The Insertionsort Algorithm  In this example, the new element goes in front of the element that was already in the sorted side. [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] [0] [1] [2] [3] [4] [5] Sorted side Unsorted side
[1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] The Insertionsort Algorithm  Sometimes we are lucky and the new inserted item doesn't need to move at all. [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] [0] [1] [2] [3] [4] [5] Sorted side Unsorted side
[1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] The Insertionsort Algorithm  Sometimes we are lucky twice in a row. [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] [0] [1] [2] [3] [4] [5] Sorted side Unsorted side
[1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] How to Insert One Element  Copy the new element to a separate location. [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] 3] [4] [5] [6] 3] [4] [5] [6] [0] [1] [2] [3] [4] [5] Sorted side Unsorted side
[1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] How to Insert One Element  Shift elements in the sorted side, creating an open space for the new element. [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] 3] [4] [5] [6] 3] [4] [5] [6] [0] [1] [2] [3] [4] [5]
[1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] How to Insert One Element  Shift elements in the sorted side, creating an open space for the new element. 3] [4] [5] [6] 3] [4] [5] [6] [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] [0] [1] [2] [3] [4] [5]
[1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] How to Insert One Element  Continue shifting elements... 3] [4] [5] [6] 3] [4] [5] [6] [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] [0] [1] [2] [3] [4] [5]
[1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] How to Insert One Element  Continue shifting elements... 3] [4] [5] [6] 3] [4] [5] [6] [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] [0] [1] [2] [3] [4] [5]
[1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] How to Insert One Element  ...until you reach the location for the new element. 3] [4] [5] [6] 3] [4] [5] [6] [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] [0] [1] [2] [3] [4] [5]
[1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] How to Insert One Element  Copy the new element back into the array, at the correct location. 3] [4] [5] [6] 3] [4] [5] [6] [0] [1] [2] [3] [4] [5] Sorted side Unsorted sid
[1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] How to Insert One Element 3] [4] [5] [6] 3] [4] [5] [6]  The last element must also be inserted. Start by copying it... [0] [1] [2] [3] [4] [5] Sorted side Unsorted sid
[1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] A Quiz [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] How many shifts will occur before we copy this element back into the array? 3] [4] [5] [6] 3] [4] [5] [6] [0] [1] [2] [3] [4] [5]
[1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] A Quiz [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] 3] [4] [5] [6] 3] [4] [5] [6]  Four items are shifted. [0] [1] [2] [3] [4] [5]
[1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] A Quiz 3] [4] [5] [6] 3] [4] [5] [6]  Four items are shifted. And then the element is copied back into the array. [0] [1] [2] [3] [4] [5]
 Both Selectionsort and Insertionsort have a worst- case time of O(n2), 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
THE END Presentation copyright 2010 Addison Wesley Longman, For use with Data Structures and Other Objects Using C++ 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.

More Related Content

PPT
Sorting of linked list data through python.ppt
raahulraaz8
 
PPTX
Sorting Algorithms
Afaq Mansoor Khan
 
PPTX
Data Structures_Searching and Sorting.pptx
RushaliDeshmukh2
 
PPT
AA_Sorting.SI.ppt
SolomonMolla4
 
PPT
Sorting
Samsil Arefin
 
PDF
Quick sort and binary search PDF
Divya modi
 
PPTX
Counting Sort
Faiza Saleem
 
PPT
Merge sort and Quick sort
Maitree Patel
 
Sorting of linked list data through python.ppt
raahulraaz8
 
Sorting Algorithms
Afaq Mansoor Khan
 
Data Structures_Searching and Sorting.pptx
RushaliDeshmukh2
 
AA_Sorting.SI.ppt
SolomonMolla4
 
Sorting
Samsil Arefin
 
Quick sort and binary search PDF
Divya modi
 
Counting Sort
Faiza Saleem
 
Merge sort and Quick sort
Maitree Patel
 

Similar to DSSchapt13.ppt (20)

PPT
Quick Sort- Marge Sort.ppt
AakritiGoyal7
 
PPT
Quicksort
maamir farooq
 
PPT
Quicksort and MergeSort Algorithm Analysis
lionelmessi593584
 
PPT
quicksort.ppthhhhhhhhhhhhhhhhhhhhhhhhhhh
zoobiarana76
 
PPT
quicksort (1).ppt
AmrutaNavale2
 
PPT
quicksort.ppt
DeepakM509554
 
PPT
Quick & Merge Sort.ppt
MuhammadSheraz836877
 
PPT
quicksort.ppt
qasimali7770272
 
PPT
quicksort.ppt
GaganaP13
 
PPT
3.8 quicksort 04
Krish_ver2
 
PPTX
Unit 5 internal sorting & files
DrkhanchanaR
 
PPTX
Hash table
Hemant Chetwani
 
PDF
第２回 基本演算，データ型の基礎，ベクトルの操作方法（解答付き）
Wataru Shito
 
PPT
quick_sort.ppt
studentsymposium
 
PPTX
Sorting_With_Array_Introduction_Presentation.pptx
krishnagarg967180
 
PDF
第２回 基本演算，データ型の基礎，ベクトルの操作方法
Wataru Shito
 
PPTX
Quicksort algorithm
Bapan Maity
 
KEY
Take & Drop (MOTM 2010.04)
Kevin Munc
 
PPT
Lec-12, 13 Quees - Circular Queues and Implementation with Array
Anil Yadav
 
PDF
Algebra Lineal con geogebra.pdf
Jesus Fuentes
 
Quick Sort- Marge Sort.ppt
AakritiGoyal7
 
Quicksort
maamir farooq
 
Quicksort and MergeSort Algorithm Analysis
lionelmessi593584
 
quicksort.ppthhhhhhhhhhhhhhhhhhhhhhhhhhh
zoobiarana76
 
quicksort (1).ppt
AmrutaNavale2
 
quicksort.ppt
DeepakM509554
 
Quick & Merge Sort.ppt
MuhammadSheraz836877
 
quicksort.ppt
qasimali7770272
 
quicksort.ppt
GaganaP13
 
3.8 quicksort 04
Krish_ver2
 
Unit 5 internal sorting & files
DrkhanchanaR
 
Hash table
Hemant Chetwani
 
第２回 基本演算，データ型の基礎，ベクトルの操作方法（解答付き）
Wataru Shito
 
quick_sort.ppt
studentsymposium
 
Sorting_With_Array_Introduction_Presentation.pptx
krishnagarg967180
 
第２回 基本演算，データ型の基礎，ベクトルの操作方法
Wataru Shito
 
Quicksort algorithm
Bapan Maity
 
Take & Drop (MOTM 2010.04)
Kevin Munc
 
Lec-12, 13 Quees - Circular Queues and Implementation with Array
Anil Yadav
 
Algebra Lineal con geogebra.pdf
Jesus Fuentes
 

Recently uploaded (20)

PPT
Chap8. Product & Service Strategy and branding
ammarilistic12306
 
PDF
Driving Innovation & Growth, Scalable Startup IT Services That Deliver Result...
Mobisoft Infotech
 
PPTX
TimeBee vs. Toggl: Which Time Tracking Tool is Best for You?
Michael Carter
 
PDF
Captivating LED Visuals, Built to Impress Brightlink.pdf
brightlinkcables
 
PDF
4. Finance for non-financial managers.08.08.2025.pdf
Alison Humphries-Engelbrecht
 
PDF
Decision trees for high uncertainty decisions
ubertubers1
 
PPT
Organizational Culture and Management.ppt
shivprasadjaysi2005
 
PDF
Chapter 1 - Introduction to management.pdf
ek19nguyenvuthuha
 
PDF
Investment Risk Assessment Brief: Zacharia Ali and Associated Entities
publicrecordswatch
 
PPTX
ENTREPRENEURSHIP..PPT.pptx..1234567891011
AnalynCanale1
 
PPTX
Daily stand up meeting on the various business
SmitNeev
 
PPTX
ELS-07 Lifeskills ToT PPt-Adama (ABE).pptx
TefferiMekonnen2
 
PDF
initiate-entrepreneurship-in-healthcare-service-management-in-sierra-leone.pdf
paulallieukamara31
 
PDF
Business Risk Assessment and Due Diligence Report: Zacharia Ali and Associate...
publicrecordswatch
 
PDF
Why Has Vertical Farming Recently Become More Economical.pdf
Skyfield Agritech
 
PDF
Chapter 3 - Business environment - Final.pdf
ek19nguyenvuthuha
 
PPT
chap9.New Product Development product lifecycle.ppt
ammarilistic12306
 
PDF
Why DevOps Teams Are Dropping Spreadsheets for Real-Time Cloud Hygiene.pdf
Sudeep Khire
 
PPTX
Transforming Finance with Ratiobox – Oracle NetSuite Bookkeeping & Accounting...
Ratiobox Limited
 
PDF
AI Cloud Sprawl Is Real—Here’s How CXOs Can Regain Control Before It Costs Mi...
Sudeep Khire
 
Chap8. Product & Service Strategy and branding
ammarilistic12306
 
Driving Innovation & Growth, Scalable Startup IT Services That Deliver Result...
Mobisoft Infotech
 
TimeBee vs. Toggl: Which Time Tracking Tool is Best for You?
Michael Carter
 
Captivating LED Visuals, Built to Impress Brightlink.pdf
brightlinkcables
 
4. Finance for non-financial managers.08.08.2025.pdf
Alison Humphries-Engelbrecht
 
Decision trees for high uncertainty decisions
ubertubers1
 
Organizational Culture and Management.ppt
shivprasadjaysi2005
 
Chapter 1 - Introduction to management.pdf
ek19nguyenvuthuha
 
Investment Risk Assessment Brief: Zacharia Ali and Associated Entities
publicrecordswatch
 
ENTREPRENEURSHIP..PPT.pptx..1234567891011
AnalynCanale1
 
Daily stand up meeting on the various business
SmitNeev
 
ELS-07 Lifeskills ToT PPt-Adama (ABE).pptx
TefferiMekonnen2
 
initiate-entrepreneurship-in-healthcare-service-management-in-sierra-leone.pdf
paulallieukamara31
 
Business Risk Assessment and Due Diligence Report: Zacharia Ali and Associate...
publicrecordswatch
 
Why Has Vertical Farming Recently Become More Economical.pdf
Skyfield Agritech
 
Chapter 3 - Business environment - Final.pdf
ek19nguyenvuthuha
 
chap9.New Product Development product lifecycle.ppt
ammarilistic12306
 
Why DevOps Teams Are Dropping Spreadsheets for Real-Time Cloud Hygiene.pdf
Sudeep Khire
 
Transforming Finance with Ratiobox – Oracle NetSuite Bookkeeping & Accounting...
Ratiobox Limited
 
AI Cloud Sprawl Is Real—Here’s How CXOs Can Regain Control Before It Costs Mi...
Sudeep Khire
 

DSSchapt13.ppt

  • 1.  Chapter 13 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 C++
  • 2. Sorting an Array of Integers  The picture shows an array of six integers that we want to sort from smallest to largest [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] [0] [1] [2] [3] [4] [5]
  • 3. [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] The Selectionsort Algorithm  Start by finding the smallest entry. [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] [0] [1] [2] [3] [4] [5]
  • 4. [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] The Selectionsort Algorithm  Start by finding the smallest entry.  Swap the smallest entry with the first entry. [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] [0] [1] [2] [3] [4] [5]
  • 5. [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] The Selectionsort Algorithm  Start by finding the smallest entry.  Swap the smallest entry with the first entry. [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] [0] [1] [2] [3] [4] [5]
  • 6. [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] The Selectionsort Algorithm  Part of the array is now sorted. [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] Sorted side Unsorted side [0] [1] [2] [3] [4] [5]
  • 7. [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] The Selectionsort Algorithm  Find the smallest element in the unsorted side. Sorted side Unsorted side [0] [1] [2] [3] [4] [5]
  • 8. [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] 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. [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] 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. [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] The Selectionsort Algorithm  The process continues... Sorted side Unsorted side Smallest from unsorted [0] [1] [2] [3] [4] [5]
  • 11. [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] The Selectionsort Algorithm  The process continues... Sorted side Unsorted side [0] [1] [2] [3] [4] [5]
  • 12. [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] The Selectionsort Algorithm  The process continues... Sorted side Unsorted side Sorted side is bigger [0] [1] [2] [3] [4] [5]
  • 13. [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] 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. [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] 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 sid
  • 15. [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] 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. [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] 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. [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] The Insertionsort Algorithm  The sorted side starts with just the first element, which is not necessarily the smallest element. [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] [0] [1] [2] [3] [4] [5] Sorted side Unsorted side
  • 18. [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] The Insertionsort Algorithm  The sorted side grows by taking the front element from the unsorted side... [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] [0] [1] [2] [3] [4] [5] Sorted side Unsorted side
  • 19. [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] The Insertionsort Algorithm  ...and inserting it in the place that keeps the sorted side arranged from small to large. [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] [0] [1] [2] [3] [4] [5] Sorted side Unsorted side
  • 20. [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] The Insertionsort Algorithm  In this example, the new element goes in front of the element that was already in the sorted side. [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] [0] [1] [2] [3] [4] [5] Sorted side Unsorted side
  • 21. [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] The Insertionsort Algorithm  Sometimes we are lucky and the new inserted item doesn't need to move at all. [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] [0] [1] [2] [3] [4] [5] Sorted side Unsorted side
  • 22. [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] The Insertionsort Algorithm  Sometimes we are lucky twice in a row. [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] [0] [1] [2] [3] [4] [5] Sorted side Unsorted side
  • 23. [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] How to Insert One Element  Copy the new element to a separate location. [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] 3] [4] [5] [6] 3] [4] [5] [6] [0] [1] [2] [3] [4] [5] Sorted side Unsorted side
  • 24. [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] How to Insert One Element  Shift elements in the sorted side, creating an open space for the new element. [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] 3] [4] [5] [6] 3] [4] [5] [6] [0] [1] [2] [3] [4] [5]
  • 25. [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] How to Insert One Element  Shift elements in the sorted side, creating an open space for the new element. 3] [4] [5] [6] 3] [4] [5] [6] [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] [0] [1] [2] [3] [4] [5]
  • 26. [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] How to Insert One Element  Continue shifting elements... 3] [4] [5] [6] 3] [4] [5] [6] [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] [0] [1] [2] [3] [4] [5]
  • 27. [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] How to Insert One Element  Continue shifting elements... 3] [4] [5] [6] 3] [4] [5] [6] [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] [0] [1] [2] [3] [4] [5]
  • 28. [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] How to Insert One Element  ...until you reach the location for the new element. 3] [4] [5] [6] 3] [4] [5] [6] [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] [0] [1] [2] [3] [4] [5]
  • 29. [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] How to Insert One Element  Copy the new element back into the array, at the correct location. 3] [4] [5] [6] 3] [4] [5] [6] [0] [1] [2] [3] [4] [5] Sorted side Unsorted sid
  • 30. [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] How to Insert One Element 3] [4] [5] [6] 3] [4] [5] [6]  The last element must also be inserted. Start by copying it... [0] [1] [2] [3] [4] [5] Sorted side Unsorted sid
  • 31. [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] A Quiz [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] How many shifts will occur before we copy this element back into the array? 3] [4] [5] [6] 3] [4] [5] [6] [0] [1] [2] [3] [4] [5]
  • 32. [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] A Quiz [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] 3] [4] [5] [6] 3] [4] [5] [6]  Four items are shifted. [0] [1] [2] [3] [4] [5]
  • 33. [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 60 70 [1] [2] [3] [4] [5] [6] A Quiz 3] [4] [5] [6] 3] [4] [5] [6]  Four items are shifted. And then the element is copied back into the array. [0] [1] [2] [3] [4] [5]
  • 34.  Both Selectionsort and Insertionsort have a worst- case time of O(n2), 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. THE END Presentation copyright 2010 Addison Wesley Longman, For use with Data Structures and Other Objects Using C++ 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.