- #include<stdio.h>
- #include<string.h>
- int quicksort(int array[],int start,int end){
- if(start<end){
- int s=start;
- int e=end;
- int key=array[s];
- while(s<e){
- while(s<e&&array[e]>=key){
- e--;
- }
- if(s<e)
- array[s]=array[e];
- while(s<e&&array[s]<key){
- s++;
- }
- if(s<e)
- array[e]=array[s];
- }
- array[s]=key;
- quicksort(array,start,s-1);
- quicksort(array,s+1,end);
- }
- }
- int main(){
- int reg[1000]={0};
- int i=0,j=0,size=0;
- for(i=0;i<1000;i++){
- printf("input %d th num:",i+1);
- scanf("%d",&j);
- if(j==-1)
- break;
- reg[i]=j;
- size++;
- }
- quicksort(reg,0,size);
- for(i=1;i<=size;i++){
- if(reg[i]!=reg[i-1]){
- printf("%d ",reg[i]);
- }
- }
- system("pause");
- return 0;
- }
- //该片段来自于http://www.codesnippet.cn/detail/2601201511628.html
来源: http://www.codesnippet.cn/detail/2601201511628.html