C++求数组最小(大)n位数字的数组解法

;void InitIt(int b[],int n)//插入排序{int j = n;int flags = j – 1;if (flags<0)return;for (; flags >= 0; flags–){if (b[j] > b[flags])break;}int temp = b[j];for (; j > flags+1 ; j–){b[j] = b[j – 1];}b[j] = temp;}void Grial(int a[], int n,int x){int i = 0;int *b = new int[x];int k = 0;int j = 0;for (; i < x; i++){b[j] = a[i];InitIt(b,j);j++;}j = i – 1;for (; i < n; i++)//类似大堆的解法{if (a[i] < b[j]){b[j] = a[i];InitIt(b,j);}}for (int m = 0; m < x; m++)//打印{cout << b[m] << endl;}}int main(){int a[] = {3,4,5,8,7,6,23,1,3,4,0,9,10,3,87,4};Grial(a,16,5);return 0;}

，带着感恩的心启程，学会爱，爱父母，爱自己，爱朋友，爱他人。