Sorting Algorithms

selection_sort.cpp

#include <iostream>

int startPos1= 0;

using namespace std;

void swap(int a[], int from, int to)
{
 if (from !=to)
 {
  cout<<"Before"<<endl; 
  cout<<"a["<<to<<"] :"<<a[to];
  cout<<"a["<<from<<"] :"<<a[from];
  cout<<endl;
  a[to] = a[to] + a[from];
  a[from] = a[to] - a[from];
  a[to] = a[to] - a[from];

  cout<<"After"<<endl; 
  cout<<"a["<<to<<"] :"<<a[to];
  cout<<"a["<<from<<"] :"<<a[from];
  cout<<endl;
 }
}

void selection_sort(int array [],int startPos, int size)
{
 // Input is an array 

 int leastElement = array[startPos];
 int leastElementPos = startPos;

if (startPos  <  size )
{ 
 for(int j = 0 ; j < size;j++)
{
 for(int i = leastElementPos; i < (size) ; i++)
 {
    if ( leastElement >  array[i+1] )
    {
       leastElement = array[i+1];
       leastElementPos = i+1;
    }
    cout<<"least Element is :"<<leastElementPos<<endl;
 }
}
 swap(array,leastElementPos,startPos);
 //selection_sort(array,startPos+1,size);
}

}



int main()
{
 int arrayToSort [] = {9,4,7,6,8,1};
 size_t sizeofa = sizeof(arrayToSort)/sizeof(int);
 for(int i = 0; i < sizeofa; ++i)
 {
  cout<<":"<<arrayToSort[i];
 }
 selection_sort(arrayToSort,0,sizeofa);
 //print array
 for(int i = 0; i <sizeofa; ++i)
 {
  cout<<":"<<arrayToSort[i];
 }

}