誰もがアルゴリズムの選択ソートを書きます
1926 ワード
#include
using std::cout;
using std::endl;
/** Selection Sort**/
int findMaxItemIndex(int dataList[], int leftPos, int rightPos)
{
int maxPos = leftPos;
int currentPos= leftPos;
while(++currentPos < rightPos)
{
if(dataList[currentPos] > dataList[maxPos])
{
maxPos = currentPos;
}
}
return maxPos;
}
void selection_sort(int dataList[], int count)
{
int i;
for(i=count-1; i>0; --i)
{
int curMaxPos = findMaxItemIndex(dataList, 0, i);
if(curMaxPos != i)
{
int temp = dataList[i];
dataList[i] = dataList[curMaxPos];
dataList[curMaxPos] = temp;
}
}
}
int main()
{
const int count = 10;
int data[count] = {7,2,6,4,0,9,5,1,3,8};
selection_sort(data, count);
for(int i = 0; i< count; i++)
{
cout<}
getchar();
}
using std::cout;
using std::endl;
/** Selection Sort**/
int findMaxItemIndex(int dataList[], int leftPos, int rightPos)
{
int maxPos = leftPos;
int currentPos= leftPos;
while(++currentPos < rightPos)
{
if(dataList[currentPos] > dataList[maxPos])
{
maxPos = currentPos;
}
}
return maxPos;
}
void selection_sort(int dataList[], int count)
{
int i;
for(i=count-1; i>0; --i)
{
int curMaxPos = findMaxItemIndex(dataList, 0, i);
if(curMaxPos != i)
{
int temp = dataList[i];
dataList[i] = dataList[curMaxPos];
dataList[curMaxPos] = temp;
}
}
}
int main()
{
const int count = 10;
int data[count] = {7,2,6,4,0,9,5,1,3,8};
selection_sort(data, count);
for(int i = 0; i< count; i++)
{
cout<}
getchar();
}
#include <iostream>
using std::cout;
using std::endl;
/** Selection Sort**/
int findMaxItemIndex(int dataList[], int leftPos, int rightPos)
{
int maxPos = leftPos;
int currentPos= leftPos;
while(++currentPos < rightPos)
{
if(dataList[currentPos] > dataList[maxPos])
{
maxPos = currentPos;
}
}
return maxPos;
}
void selection_sort(int dataList[], int count)
{
int i;
for(i=count-1; i>0; --i)
{
int curMaxPos = findMaxItemIndex(dataList, 0, i);
if(curMaxPos != i)
{
int temp = dataList[i];
dataList[i] = dataList[curMaxPos];
dataList[curMaxPos] = temp;
}
}
}
int main()
{
const int count = 10;
int data[count] = {7,2,6,4,0,9,5,1,3,8};
selection_sort(data, count);
for(int i = 0; i< count; i++)
{
cout<<data[i]<<endl;
}
getchar();
}