Data-Structures-Algorithms/Sorting/Selectionsort.cpp at master · nimit95/Data-Structures-Algorithms · GitHub

33 lines (33 loc) · 520 Bytes

#include<iostream.h>

#include<conio.h>

void main()

{

clrscr();

int size, arr[50], i, j, temp;

cout<<"Enter Array Size : ";

cin>>size;

cout<<"Enter Array Elements : ";

for(i=0; i<size; i++)

{

cin>>arr[i];

}

cout<<"Sorting array using selection sort...\n";

for(i=0; i<size; i++)

{

for(j=i+1; j<size; j++)

{

if(arr[i]>arr[j])

{

temp=arr[i];

arr[i]=arr[j];

arr[j]=temp;

}

cout<<"Now the Array after sorting is :\n";

for(i=0; i<size; i++)

{

cout<<arr[i]<<" ";

}

getch();

}

Expand file tree