'정렬'에 해당되는 글 1건

#include<iostream>
#include<iomanip>
using namespace std;

#define MAX_ARY 15

void selectionSort(int list[], int last);

int main()
{

 int ary[MAX_ARY]={12,12,23,54,67,43,67,87,56,4,3,2,54,67,9};

 cout << "before sort"<<endl;

 for(int i=0; i<MAX_ARY; i++)
 {
  cout<<setw(3)<<ary[i];
 }

 cout<<endl;

 cout<<"after selection sort"<<endl;

 selectionSort(ary, MAX_ARY-1);

 for(int i=0; i<MAX_ARY; i++)
 {
  cout<<setw(3)<<ary[i];
 }
 cout<<endl;

}

void selectionSort(int list[], int last)
{
 int current;
 int smallest; 
 int hold;
 int walker;

 for(current = 0; current < last; current++)
 {
  smallest=current;
  
  for(walker = current +1; walker<=last; walker++)
  {
   if(list[walker]< list[smallest])
   {
    smallest = walker;
   }
  }//for
  //최소값이 선택됨. 현재요소와 교환
  hold = list[current];
  list[current] = list[smallest];
  list[smallest] = hold;
  cout<<"PASS"<< current+1<<":";
  for(int i=0; i<MAX_ARY; i++)
  {
  cout<<setw(3)<<list[i];
  }
  cout<<endl;
 }
}