Sorting Techniques

15/10/01

Click here to start

Table of Contents

Sorting Techniques

How does it work?

Insertion Sort technique.

Insertion Sort Algorithm

Selection Sort Algorithm

The inner loop in the above algorithm finds the location of the next smallest element in the array (the location of the next smallest element in the array).

Bubble Sort Algorithm

Implementation of Quicksort

Implementation of Quicksort()

i stops at 4 (a[4] or V>= G), and loc at 8 (a[8] or D <= G). These values are then swapped.

i and loc continue to move until i > loc

Algorithm for partition(a,first,last,loc)

Recursive Quicksort Algorithm

Recursive Quicksort Algorithm

Divide and Conquer

Author: Computer Science Dept.