壹個java編程題，怎麽求出數組中重復數字的出現次數，並按次數從大到下排序

#include <iostream>?#include <string>?#include <fstream>?using namespace std;?int count=0;?void countNum(int a[],int start,int finish)?{?//cout<<start<<" \n"<<finish<<"\n";?int middle=(start+finish)/2;?if(start>finish)?return ;?if(a[middle]==2)?{?count++;?countNum(a,start,middle-1);?countNum(a,middle+1,finish);?//cout<<"get here"<<middle<<endl;?}else if(a[middle]>2)?{?countNum(a,start,middle-1);?}else

{

countNum(a,middle+1,finish);

}

//return count;?}?int main()?{?int s[1000];?ifstream inf("1.txt");?int i=0;

while(!inf.eof())

{inf>>s[i];i++;}?//int s[]={1,2,2,2,3};?int start=0;//,finish=NUM-1;?countNum(s,start,i-1);?cout<<count<<endl;?}

擴展資料

#include<iterator>

template<typenamebiIter>

voidinsertion_sort(biIterbegin,biIterend)

{

typedeftypenamestd::iterator_traits<biIter>::value_typevalue_type;

biIterbond=begin;

std::advance(bond,1);

for(;bond!=end;std::advance(bond,1)){

value_typekey=*bond;

biIterins=bond;

biIterpre=ins;

std::advance(pre,-1);

while(ins!=begin&&*pre>key){

*ins=*pre;

std::advance(ins,-1);

std::advance(pre,-1);

}

*ins=key;

}

}

參考資料：

百度百科 排序

上一篇:高中哪裏可以聽網課免費

下一篇:vivo手機的智能機器人怎麽喚醒