Selection Sort Section 10.2 Code for Selection Sort (cont.) Code - - PowerPoint PPT Presentation

▶

Dec 09, 2022 542 likes •929 views

Selection Sort Section 10.2 Code for Selection Sort (cont.) Code for an Array Sort Code for an Array Sort Code for Selection Sort (cont.) Code for Selection Sort (cont.) Code for Selection Sort (cont.) Bubble Sort Section 10.3 Code for

SLIDE 1

Section 10.2

Selection Sort

SLIDE 2

Code for Selection Sort (cont.)

SLIDE 3

Code for an Array Sort

SLIDE 4

Code for an Array Sort

SLIDE 5

Code for Selection Sort (cont.)

SLIDE 6

Code for Selection Sort (cont.)

SLIDE 7

Code for Selection Sort (cont.)

SLIDE 8

Section 10.3

Bubble Sort

SLIDE 9

Code for Bubble Sort

SLIDE 10

Code for Bubble Sort

SLIDE 11

Section 10.4

Insertion Sort

SLIDE 12

Code for Insertion Sort

SLIDE 13

Code for Insertion Sort

SLIDE 14

Using iterator_traits to Determine the Data Type of an Element

 The following version of function insert follows the algorithm

more closely

typename std::iterator_traits<RI>::value_type next_val = *next_pos;  The statement above declares variable next_val and stores

the element referenced by next_pos in it

 The template class iterator_traits is defined in the

header <iterator>, and value_type represents the data type of the element referenced by the iterator next_pos

SLIDE 15

Using iterator_traits to Determine the Data Type of an Element (cont.)

template<typename RI> void insert(RI first, RI next_pos) { typename std::iterator_traits<RI>::value_type next_val = *next_pos; // next_val is element to insert. while (next_pos != first && next_val < *(next_pos - 1)) { *next_pos = *(next_pos - 1);

-next_pos; // Check next smaller element.

} *next_pos = next_val; // Store next_val where it belongs. }

SLIDE 16

Section 10.6

Shell Sort: A Better Insertion Sort

SLIDE 17

Code for Shell Sort

SLIDE 18

Code for Shell Sort

SLIDE 19

Code for Shell Sort

SLIDE 20

Section 10.7

Merge Sort

SLIDE 21

Code for Merge

SLIDE 22

Code for Merge

SLIDE 23

Code for Merge Sort

SLIDE 24

Code for Merge Sort

SLIDE 25

Section 10.8

Heapsort

SLIDE 26

Code for Heapsort

SLIDE 27

Code for Heapsort (cont.)

SLIDE 28

Code for Heapsort (cont.)

SLIDE 29

Section 10.9

Quicksort

SLIDE 30

Code for Quicksort

SLIDE 31

Code for partition

SLIDE 32

Code for Revised partition Function

SLIDE 33

Code for Revised partition Function

SLIDE 34

Section 10.10

Testing the Sort Algorithms

SLIDE 35

Testing the Sort Algorithms

 We want to get some idea of the sorting algorithms’

relative performance when sorting the same container (array, vector, or deque)

 Use a variety of test cases

 small and large containers  containers with elements in random order  containers that are sorted already  containers with duplicate values

SLIDE 36

Driver to Test Sort Algorithms

SLIDE 37