資源簡介
C++實戰(zhàn)源碼-有序數(shù)組折半查找(入門級實例123).zip
代碼片段和文件信息
//?array.cpp?:?Defines?the?entry?point?for?the?console?application.
//
#include?“stdafx.h“
#include?“iostream.h“
int?main()
{
int?ijtn=0num;
int?a[10];
//從鍵盤為數(shù)組元素賦值
for(i=0;i<10;i++)
{
cout<<“a[“< cin?>>a[i];
}
//對數(shù)組排序
for(i=0;i<9;i++)
{
for(j=0;j<9-i;j++)
{
if(a[j]?>?a[j+1])
{
t?=?a[j];
a[j]?=?a[j+1];
a[j+1]?=?t;
}
}
}
cout<<“輸入要查找的數(shù)據(jù):“<<“\n“;
cin?>>num;
cout<<“輸出數(shù)組:“<<“\n“;
for(i=0;i<10;i++)
{
cout< if((i+1)%3?==?0)
{
cout<<“\n“;
}
}
cout<<“\n“;
int?left?=?0right?=?9mid;
while(left? {
mid?=?(left+right)/2;
if(a[mid]?==?num)
{
cout<<“要查找的元素是:“<<“\n“;
cout<<“a[“< n++;
}
if(a[mid]? {
left?=?mid+1;
}
else
{
right?=?mid-1;
}
}
if(n?==?0)
{
cout<<“要查找的元素不存在!“<<“\n“;
}
}
?屬性????????????大小?????日期????時間???名稱
-----------?---------??----------?-----??----
?????文件?????????957??2010-07-14?21:02??array\array.cpp
?????文件????????4524??2010-07-14?11:32??array\array.dsp
?????文件?????????535??2010-07-14?11:32??array\array.dsw
?????文件?????????292??2010-07-14?11:32??array\StdAfx.cpp
?????文件?????????769??2010-07-14?11:32??array\StdAfx.h
評論
共有 條評論