sorting bug

[Zu007]

#include<conio.h>
#include<iostream.h>
void  main()
{
clrscr();
int array[5],min,temp,i,loc,j;
for(i=0;i<5;i++)
{
cout<<"Enter the value of"<<"array["<<i<<"]";
cin>>array[i];
cout<<endl;
}
for(i=0;i<5;i++)
{
cout<<array[i]<<"  ";
}
for(i=0;i<4;i++)
{
min=i;
for(j=1+i;j<5;j++)
{
if(array[j]<array[min])
min=j;
if(min!=i)
{
temp=array[i];
array[i]=array[min];
array[min]=temp;

}
}
}
cout<<endl;
for(i=0;i<5;i++)
{
cout<<array[i]<<"  ";
}
getch();
}

output :
input 1 2 3 4 5 6
output 1 2 3 4 5 6 //correct

input 5 2 3 4 6
output 3 2 5 4 6 // worng

input 6 5 4 3 2 1
output 1 2 3 4 5 6 //correct

plz help why are 5 2 3 4 6 give worng result

[ne555]

Please indent your code. (some comments may help too)
Do a desk test, look carefully what are 'i', 'j', 'min' pointing.

[JLBorges]

// #include<conio.h> // not a standard C++ header
//#include<iostream.h> // not a standard C++ header
#include <iostream> 
using namespace std ;

// void  main() // main() must return int
int main() 
{
    // ...

   // for(i=0;i<4;i++) // what about array[4] ?
   for(i=0;i<5;i++)
   {
       min=i;

   // ...

}

[ne555]

By construction array[4] should end with the correct value.

One of the good things about selection sort is that you just need to do O(n) swaps of the objects. You kill that property.
Look carefully

if(array[j]<array[min])
  min=j;
if(min!=i)
{//swap( array[i], array[min] )
  temp=array[i];
  array[i]=array[min];
  array[min]=temp;
}

If you do the swap, then min will no longer point to the minimum element.