折半排序

#include<iostream>using namespace std;int main(){int list[6]={0,34,2,45,-2,3};int insertnode=0;for(int i=1;i<6;i++){int low=0;int high=i-1;insertnode=list[i];while(low<=high){int mid=(low+high)/2;if(list[mid]<list[i]){low=mid+1;} else{high=mid-1;}}for(int j=i;j>low;j--){list[j]=list[j-1];}list[low]=insertnode;}for(int i=0;i<6;i++){cout<<list[i]<<" ";}return 0;}