Sorting & Searching

>Sorting
Consider an integer vector
Sorting means arranging its elements into sequential order
Numerical elements can be sorted in ascending or descending order
Element on which sorting is done is called as key


>Searching
Scanning of a set of items in order to locate a desired item

>Sorting algorithms
Bubble Sort
Selection Sort
Insertion Sort
Merge Sort
Quick Sort

>Searching algorithms
Sequential (Linear) Search
Binary Search

Example Queue
Consider a vector which contains 5 elements
Let us assume that the queue is initially empty
It is required to insert elements
PAUL
RICK
BOB
Delete elements
PAUL
RICK
Insert elements
JOHN
GRANT
KEN