Scribd
Upload
6 views

Sorting Algorithms

This document discusses three sorting algorithms: bubble sort, selection sort, and insertion sort. It provides code examples to implement each algorithm and sort an array of integers. For each algorithm, it loops through the array to sort it and outputs the sorted array.

Uploaded by

ethiopia1212 etho
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
6 views

Sorting Algorithms

This document discusses three sorting algorithms: bubble sort, selection sort, and insertion sort. It provides code examples to implement each algorithm and sort an array of integers. For each algorithm, it loops through the array to sort it and outputs the sorted array.

Uploaded by

ethiopia1212 etho
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

Implementing simple sorting algorithms

1. Bubble Sort Algorithm.

#include<iostream>
using namespace std;
int main ()
{
int i, j,temp,pass=0;
int a[10] = {10,2,0,14,43,25,18,1,5,45};
cout <<"Input list ...\n";
for(i = 0; i<10; i++) {
cout <<a[i]<<"\t";
}
cout<<endl;
for(i = 0; i<10; i++) {
for(j = i+1; j<10; j++)
{
if(a[j] < a[i]) {
temp = a[i];
a[i] = a[j];
a[j] = temp;
}
}
pass++;
}
cout <<"Sorted Element List ...\n";
for(i = 0; i<10; i++) {
cout <<a[i]<<"\t";
}
cout<<"\nNumber of passes taken to sort the list:"<<pass<<endl;
return 0;
}

2. Selection Sort algorithm.


#include<iostream>
using namespace std;
int findSmallest (int[],int);
int main ()
{
int myarray[10] = {11,5,2,20,42,53,23,34,101,22};
int pos,temp,pass=0;
cout<<"\n Input list of elements to be Sorted\n";
for(int i=0;i<10;i++)
{
cout<<myarray[i]<<"\t";
}
for(int i=0;i<10;i++)
{
pos = findSmallest (myarray,i);
temp = myarray[i];
myarray[i]=myarray[pos];
myarray[pos] = temp;
pass++;
}
cout<<"\n Sorted list of elements is\n";
for(int i=0;i<10;i++)
{
cout<<myarray[i]<<"\t";
}
cout<<"\nNumber of passes required to sort the array: "<<pass;
return 0;
}
int findSmallest(int myarray[],int i)
{
int ele_small,position,j;
ele_small = myarray[i];
position = i;
for(j=i+1;j<10;j++)
{
if(myarray[j]<ele_small)
{
ele_small = myarray[j];
position=j;
}
}
return position;
}

3. Insertion Sort Algorithm


#include<iostream>
using namespace std;
int main ()
{
int myarray[10] = { 12,4,3,1,15,45,33,21,10,2};

cout<<"\nInput list is \n";


for(int i=0;i<10;i++)
{
cout <<myarray[i]<<"\t";
}
for(int k=1; k<10; k++)
{
int temp = myarray[k];
int j= k-1;
while(j>=0 && temp <= myarray[j])
{
myarray[j+1] = myarray[j];
j = j-1;
}
myarray[j+1] = temp;
}
cout<<"\nSorted list is \n";
for(int i=0;i<10;i++)
{
cout <<myarray[i]<<"\t";
}
}

You might also like