Scribd
Upload
54 views

Simple Sorting Algorithms: Bubble Sort Seletion Sort Insertion Sort

The document describes three simple sorting algorithms: bubble sort, selection sort, and insertion sort. It provides pseudocode to implement each algorithm and analyzes their time complexities. Bubble sort compares adjacent elements and swaps them if out of order until sorted. Selection sort finds the minimum element in each pass and swaps it into place. Insertion sort inserts each next element into the sorted portion by shifting larger values to the right.

Uploaded by

FanBoyGoodBoy
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
54 views

Simple Sorting Algorithms: Bubble Sort Seletion Sort Insertion Sort

The document describes three simple sorting algorithms: bubble sort, selection sort, and insertion sort. It provides pseudocode to implement each algorithm and analyzes their time complexities. Bubble sort compares adjacent elements and swaps them if out of order until sorted. Selection sort finds the minimum element in each pass and swaps it into place. Insertion sort inserts each next element into the sorted portion by shifting larger values to the right.

Uploaded by

FanBoyGoodBoy
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 10

SIMPLE SORTING ALGORITHMS

Bubble Sort Seletion Sort Insertion Sort

BUBBLE SORT
Compare each element (except the last one) with its neighbor to the right
If they are out of order, swap them This puts the largest element at the very end The last element is now in the correct and final place

Compare each element (except the last two ) with its neighbor to the right
If they are out of order, swap them This puts the second largest element next to last The last two elements are now in their correct and final places

Compare each element (except the last three ) with its neighbor to the right
Continue as above until you have no unsorted elements on the left
2

EXAMPLE OF BUBBLE SORT

7 2 8 5 4

2 7 5 4 8

2 5 4 7 8

2 4 5 7 8

2 7 8 5 4
2 7 8 5 4 2 7 5 8 4 2 7 5 4 8

2 7 5 4 8
2 5 7 4 8 2 5 4 7 8

2 5 4 7 8
2 4 5 7 8

2 4 5 7 8
(done)

CODE FOR BUBBLE SORT


void bubbleSort() { int outer, inner; for (outer = N - 1; outer > 0; outer--) // counting down { for (inner = 0; inner < outer; inner++) // bubbling up { if (a[inner] > a[inner + 1]) // if out of order... { int temp = a[inner]; // ...then swap a[inner] = a[inner + 1]; a[inner + 1] = temp; } } } }
4

ANALYSIS OF BUBBLE SORT


for (outer = a.length - 1; outer > 0; outer--) { for (inner = 0; inner < outer; inner++) { if (a[inner] > a[inner + 1]) { // code for swap omitted } } } Let n = a.length = size of the array The outer loop is executed n-1 times (call it n , thats close enough) Each time the outer loop is executed, the inner loop is executed Inner loop executes n-1 times at first, linearly dropping to just once On average, inner loop executes about n/2 times for each execution of the outer loop In the inner loop, the comparison is always done, the swap might be done 5

ANOTHER SORT: SELECTION SORT


Given an array of length n ,
Search elements 0 through n-1 and select the smallest
Swap it with the element in location 0

Search elements 1 through n-1 and select the smallest


Swap it with the element in location 1

Search elements 2 through n-1 and select the smallest


Swap it with the element in location 2

Search elements 3 through n-1 and select the smallest


Swap it with the element in location 3

Continue in this fashion until theres nothing left to search


6

EXAMPLE AND ANALYSIS OF SELECTION SORT


7 2 8 5 4 2 7 8 5 4
Analysis:

The Selection Sort might swap an array element with itself --this is harmless, and not worth checking for

2 4 8 5 7 2 4 5 8 7

The outer loop executes n-1 times The inner loop executes about n/2 times on average (from n to 2 times) Work done in the inner loop is constant (swap two array elements)

2 4 5 7 8
7

CODE FOR SELECTION SORT


void selectionSort() { int outer, inner, min; for (outer = 0; outer < N - 1; outer++) // outer counts down { min = outer; for (inner = outer + 1; inner < N; inner++) { if (a[inner] < a[min]) { min = inner; } } // a[min] is least among a[outer]..a[ a.length - 1] int temp = a[outer]; a[outer] = a[min]; a[min] = temp; } }
8

ONE STEP OF INSERTION SORT


sorted next to be inserted
temp 10

3 4 7 12 14 14 20 21 33 38 10 55 9 23 28 16
less than 10

12 14 20 21 38 3 4 7 10 12 14 14 21 20 33 33 10 38 55 9 23 28 16 sorted

CODE FOR INSERTION SORT


void insertionSort() { int inner, outer; for (outer = 1; outer < N; outer++) { int temp = a[outer]; inner = outer; while (inner > 0 && a[inner - 1] >= temp) { a[inner] = a[inner - 1]; inner--; } a[inner] = temp; } }
10

You might also like