Chap-2 DSA (2017)
Chap-2 DSA (2017)
Chap-2 DSA (2017)
Faculty of Informatics
Department of Computer Science
CoSc2083 – Data structures and Algorithms
Chapter 2 Handout –Sorting & Searching
1. Sorting Algorithms
Sorting is one of the most important operations performed by computers. Sorting is a process
of reordering a list of items in either increasing or decreasing order. The following are simple
sorting algorithms used to sort small-sized lists.
• Insertion Sort
• Selection Sort
• Bubble Sort
The insertion sort works just like its name suggests - it inserts each item into its proper place in
the final list. The simplest implementation of this requires two list structures - the source list
and the list into which sorted items are inserted. To save memory, most implementations use
an in-place sort that works by moving the current item past the already sorted items and
repeatedly swapping it with the preceding item until it is in place.
It's the most instinctive type of sorting algorithm. The approach is the same approach that you
use for sorting a set of cards in your hand. While playing cards, you pick up a card, start at the
beginning of your hand and find the place to insert the new card, insert it and move all the
Basic Idea:
Find the location for an element and move all others up, and insert the element.
Implementation
1+2+3+…+(n-1)= O(n2)
1+2+3+…+(n-1)= O(n2)
In-place algorithm
Basic Idea:
Implementation:
Analysis
(n-1)+(n-2)+…+1= O(n2)
n=O(n)
In-place algorithm
Bubble sort is the simplest algorithm to implement and the slowest algorithm on very large
inputs.
Basic Idea:
Loop through array from i=0 to n and swap adjacent elements if they are out of order.
Implementation:
void bubble_sort(list[])
{
int i,j,temp;
for(i=0;i<n; i++){
for(j=n-1;j>i; j--){
if(list[j]<list[j-1]){
temp=list[j];
(n-1)+(n-2)+…+1= O(n2)
(n-1)+(n-2)+…+1= O(n2)
Space?
In-place algorithm.
General Comments
Each of these algorithms requires n-1 1 passes: each pass places one item in its correct place. The
ith pass makes either i or n - i comparisons and moves. So:
or O(n2). Thus these algorithms are only suitable for small problems where their simple code
makes
kes them faster than the more complex code of the O(n O( logn)) algorithm. As a rule of thumb,
expect to find an O(n logn)) algorithm faster for n>10 - but the exact value depends very much on
individual machines!.
Empirically it’s known that Insertion sort is over twice as fast as the bubble sort and is just as
easy to implement as the selection sort. In short, there really isn't any reason to use the
selection sort - use the insertion sort instead.
If you really want to use the selection sort for some reason,
reason, try to avoid sorting lists of more
than a 1000 items with it or repetitively sorting lists of more than a couple hundred items.
3. Searching
Searching is a process of looking for a specific element in a list of items or determining that the
item is not
ot in the list. There are two simple searching algorithms:
3.1
.1 Linear Search (Sequential Search)
Pseudocode
Example
The computational time for this algorithm is proportional to log2 n. Therefore the time
complexity is O(log n)
Implementation:
For the kth iteration of the binary search loop, the search region is (1/2k-1) of the array.
What’s the maximum number of loop iterations?
log2n
That is, we can’t cut the search region in half more than that many times.
So, the time complexity of binary search is O(log2n).
NOTE:
• Sequential Searches
• Time is proportional to n
• We call this time complexity O(n)
• Pronounce this “big oh” of n
• Array is unsorted.
• Binary search
• Sorted array
• Time proportional to log2 n
• Time complexity O(log n)
/* 1.a Program for Linear Search
Written by your name idno date */
#include<iostream.h>
void linsearch(int a[10], int n)
{
int key,f=0;
cout<<"Enter the key to be Searched:"<<endl;
cin>>key;
for (int i =0; i<n; i++)
{
if (a[i] == key)
{
cout<<"Key found in location :" << (i+1);
f=1;
break;
}
}
if (f==0)
cout<<"Key is not present in the list";
}
int main()
{
int a[10],n;
cout<<"Enter number of items in the list:"<<endl;
cin>>n;
int main()
{
int list[100],n;
cout<<”SELECTION SORT”<<endl;
cout<<”_____________”<<endl;
cout<<"Enter no. of items to be Sorted (N):";
cin>>n;
cout<<”Enter the items:”;
for(int i=0;i<n;i++)
cin>>list[i];
selection_sort(list,n);
return(0);
}
/* 2.c Program for Bubble Sort
Written by your name idno date */
#include<iostream.h>
void bubble_sort(int list[],int n)
{
int i,j,temp;
for(i=0;i<n; i++){
for(j=n-1;j>i; j--){
if(list[j]<list[j-1]){
temp=list[j];
list[j]=list[j-1];
list[j-1]=temp;
}//swap adjacent elements
}//end of inner loop
}//end of outer loop
cout<<”Sorted List:”<<endl;
for(i=0;i<n;i++)
cout<<list[i]<<"\t";
}//end of bubble_sort
int main()
{
int list[100],n;