Sorting means . . .

2/24/99

Click here to start

Table of Contents

Sorting means . . .

Straight Selection Sort

Selection Sort: Pass One

Selection Sort: End Pass One

Selection Sort: Pass Two

Selection Sort: End Pass Two

Selection Sort: Pass Three

Selection Sort: End Pass Three

Selection Sort: Pass Four

Selection Sort: End Pass Four

Selection Sort: How many comparisons?

For selection sort in general

Notice that . . .

For selection sort in general

Sorting Algorithms and Average Case Number of Comparisons

Using quicksort algorithm

Before Partitioning

After Partitioning

Quick Sort of N elements: How many comparisons?

Quick Sort of N elements:How many partitions can occur?

Before Partitioning

After Partitioning

MergeSort Algorithm

Using Merge Sort Algorithm with N = 16 elements

Merge Sort of N elements: How many comparisons?

Big-O Comparison of Sorting Algorithms

Function BinarySearch( )

found = BinarySearch(vec, 25, 0, 14 );

Author: Sylvia Sorkin

Email: ssorkin@essex.cc.md.us

Home Page: http://www.essex.cc.md.us/Essex/People/ssorkin/index.html

Download presentation source