#include <iostream>using namespace std;int power[] = {15,25,90,23,10}, temp;int numslen = sizeof(power) / sizeof(int); //計算實際長度int min = power[0]; //假設(shè)最小值是數(shù)組的第一個元素int minIndex = 0; //最小值的初始下標(biāo)是0void spot() //排序函數(shù){for (int i = 0; i < numslen; i++){min = power[i];//假設(shè)第i個元素是最小值minIndex = i;for (int j = i + 1; j < numslen; j++){if(power[j]<min){min = power[j];minIndex = j;}}if (minIndex > i){temp = power[minIndex];power[minIndex] = power[i];power[i] = temp;}}cout << "排序后：";for (int i = 0; i < numslen; i++)cout << power[i]<<",";}int main() //插入數(shù)后排序{int insert,insertIndex;cout << "請輸入要插入的數(shù)：" << endl;cin >> insert;for (int i = 0; i < numslen; i++){if (insert > power[i]){insertIndex = i;break;}}for (int i = numslen - 1; i >= insertIndex; i--){power[i + 1] = power[i];}power[insertIndex] = insert;numslen++;cout << "插入數(shù)值后排序結(jié)果為" <<spot(insert) << endl;return 0;}