Selectionsort.cpp

/* 
So we are going to implement selection sort.
In this we select smallest element and move it to the sorted subarray of the main array.
We repeat it several times until whole array is sorted.
*/

void selectionSort(int arr[], int n){
  int i,j,min;
  
  for(i=0;i<n-1i++){
    min=i;
    for(j=i+1;j<n;j++){
      if(arr[j]<arr[min])
        min=j;
    }
    swap(&arr[min],&arr[i]);
  }
}
void swap(int *x, int *y){
  int temp = *x;
  *x=*y;
  *y=temp;
}

void printarr(int arr[], int size){
  int i;
  for(i=0;i<size;i++)
    cour<<arr[i]<<" ";
}

int main(){
  int arr[]={7,4,56,45,76,32,46,98,87,61};
  int n=sizeof(arr)/sizeof(arr[0]);
  selectionSort(arr,n);
  printarr(arr,n);
  return 0;
}