|
#include<iostream> using namespace std; void QuickSort(double a[], int left,int right) {if(left<right) {int i=left; int j=right; double x=a[i]; while(i<j) {while(i<j&&a[j]>x) j--; if(i<j) {a[i]=a[j]; i++;} while(i<j&&a[i]<x) i++; if(i<j) {a[j] = a[i]; j--;}} a[i]=x; QuickSort(a, left, i-1); QuickSort(a, i+1, right); }} int main() {int i,k; double a[100]; char s; for(i=0;i<100;i++) {cin>>a[i]; if(getchar()==‘\n‘)break;else k++;} QuickSort(a,0,i-1); cout<<"排序后的数为: "; for(i=0;i<k;i++) cout<<a[i]<<‘ ‘; cout<<endl; return 0; }
|