//30根細條得到30個長度值，選擇出現值相近且出現次數最多的，算其均值作為輸出
#include <iostream>
using namespace std;int main()
{double dRawdata[5] = {1.1,1.2,1.3,2.5,3.2};//先升序排序double dSort[5][5] = {0};double* p = dRawdata;int a=1,b=0,c=0,d=0,e=0;dSort[0][0] = *p;for(int i =1;i<5;i++){cout<<(*p-dRawdata[i])<<endl;if((*p/*將*p改為下面計算的均值*/-dRawdata[i])<0.5 && (*p-dRawdata[i])> -0.5){dSort[0][a] = dRawdata[i];//做一次均值，下次比較時用之前算的均值比較a++;}else if((*p-dRawdata[i])>0.5 || (*p-dRawdata[i])< -0.5){dSort[1][b] = dRawdata[i];b++;}p++;}for(int k = 0;k<5;k++){for(int j=0;j<5;j++){cout <<dSort[k][j]<<" ";}cout<<endl;}cout << "Hello World";return 0;
}

?