C语言关于线性搜索 ★ c语言中的线性数据结构是指什么？
c\u8bed\u8a00\u7ebf\u6027\u8868\u67e5\u627e\u5143\u7d20\uff0c\u4e0d\u77e5\u9053\u54ea\u91cc\u51fa\u9519\u4e86\u2026\u2026#include #define MAXSIZE 50typedef char Elemtype;typedef struct { Elemtype elem[MAXSIZE]; int last;}seqlist;void Initseqlist(seqlist L){ L.last=0;}int locate(seqlist L,Elemtype x){ int i=0; while((i<=L.last)&&(L.elem[i]!=x)) i++; if(i<=L.last) return (i+1); else return (-1);}void main(){ int i,n,m; char e; seqlist L1;Initseqlist(L1); printf("\u8bf7\u8f93\u5165\u6570\u636e\u7684\u957f\u5ea6\uff1a"); scanf("%d",&n); getchar(); //\u5403\u6389\u6362\u884c L1.last=n; printf("\u8bf7\u8f93\u5165\u6570\u636e\u5143\u7d20\uff1a"); for(i=0;i<n;i++) //\u591a\u4e86\u7b49\u53f7 { scanf("%c",&L1.elem[i]); } printf("\u8bf7\u8f93\u5165\u8981\u67e5\u627e\u7684\u5143\u7d20\uff1a"); getchar();//\u5403\u6389\u6362\u884c scanf("%c",&e); m=locate(L1,e); printf("%d\n",m);}
\u6839\u636e\u4f60\u7684\u8fd9\u4e2a\u9898\uff0c\u4f60\u8981\u77e5\u9053\uff0c\u94fe\u8868\u90fd\u662f\u7ebf\u6027\u7ed3\u6784\u3002
\u7ebf\u6027\u7ed3\u6784\u6307\u7684\u662f\uff1a1.\u53ea\u67091\u4e2a\u5934\uff0c\u53ea\u67091\u4e2a\u5c3e\uff1b2.\u9664\u4e86\u9996\u5c3e\uff0c\u7ed3\u70b9\u4e0e\u7ed3\u70b9\u5b58\u57281\u5bf91\u5173\u7cfb\uff0c\u4e5f\u5c31\u662f\u67091\u4e2a\u524d\u9a711\u4e2a\u540e\u7ee7\uff1b3.\u5934\u53ea\u6709\u540e\u7ee7\uff0c\u5c3e\u53ea\u6709\u524d\u9a71\u3002
A\u7b54\u6848\u4e0d\u7b26\u5408\u7b2c1\u6761
B\u6b63\u786e\uff0c\u6811\u7ed3\u6784\u53ea\u67091\u4e2a\u6839
CD\uff0c\u5982\u524d\u6240\u8bf4\uff0c\u94fe\u8868\u662f\u7ebf\u6027\u7ed3\u6784\u3002\u5faa\u73af\u548c\u53cc\u5411\u53ea\u662f\u4e3a\u4e86\u904d\u5386\u65b9\u4fbf\u3002
#include <stdio.h>
#include <string.h>
typedef struct student {
char name[30];
unsigned matrno;
}student;
student participants[] = {
{"Jonh Doe",111},
{"Bob Baumei",139},
{"Jane Smith",140},
{"Jack Archer",140},
{"Jonhnny Mahony",167},
{"Simo Anthony",170},
{"Marylin Anderson",174},
{"Melanie Thomson",181},
{"Sydney Core",183},
{"Steve Smith",186},
};
int noFstud = 10;
int linSearchByName(char name[]) {
int i;
for(i = 0; i < noFstud; ++i) {
if(strcmp(name,participants[i].name) == 0)
return i;
}
return -1;
}
int main() {
char name[30];
int res;
printf("Input a name:");
res = linSearchByName(name);
if(res == -1) printf("no find.
");
else printf("%s %u
",participants[res].name,participants[res].matrno);
return 0;
}
#include <stdio.h>
#include <string.h>
typedef struct student {
char name[30];
unsigned matrNo;
} student;
/* global variables */
student participants[] = {
{"John Doe", 111},
{"Bob Baumeister", 139},
{"Jane Smith", 140},
{"Jack Archer", 141},
{"Johnny Mahony", 167},
{"Simon Anthony", 170},
{"Marylin Anderson", 174},
{"Melanie Thomson", 181},
{"Sydney Core", 183},
{"Steve Smith", 186}
};
int noOfStud = 10;
int linSearchByName(char name[30]) {
int i;
for (i=0;i<noOfStud;i++) {
if (strcmp(name, participants[i].name)==0)
return i;
}
return -1;
}
int main() {
char name[30];
int i;
printf("Input name:");
gets(name);
i = linSearchByName(name);
if (i>=0) {
printf("%s's matriculation number is %d
", name, participants[i].matrNo);
} else {
printf("%s is not found.
", name);
}
return 0;
}
绛旓細111},{"Bob Baumei",139},{"Jane Smith",140},{"Jack Archer",140},{"Jonhnny Mahony",167},{"Simo Anthony",170},{"Marylin Anderson",174},{"Melanie Thomson",
绛旓細for(p1=head;p1->next!=pfinished;)//瀵归摼琛ㄨ繘琛屼粠澶у埌灏忔帓搴(杩欓噷鐢ㄥ啋娉℃硶) //p1浣夸箣鎬绘槸鎸囧悜澶寸粨鐐,pfinished浣夸箣鎬绘槸鎸囧悜宸叉帓搴忓ソ鐨勬渶鍓嶉潰鐨勭粨鐐 //ptemp浣滀负涓粙,淇濆瓨p2鐨勪笂涓涓粨鐐 { for(p2=p1;p2->next!=pfinished;) { if(*(&(p2->math)+num-'0')<*(&(p2->next->math)+num-'0'...
绛旓細鍗冲厛瀵杈撳叆鐨勬暟鎹繘琛屾帓搴,鍥犱负浣犳棤娉曚繚璇佽緭鍏ョ殑瀛︾敓鎴愮哗閮芥槸鏈夐『搴忕殑,鎵浠ュ厛瑕佹帓搴,鐒跺悗灏辨槸鏌ユ壘浜,鍙互閲囩敤浜屽垎娉曟煡鎵,瀹炵幇绠鍗曚篃姣旇緝蹇竴浜涖傚綋鐒跺鏋滃鐢熸暟鍦10涓互鍐,鐩存帴绾挎ф煡鎵涔熸槸涓嶉敊鐨,宸埆涓嶄細澶ぇ銆 niluanxy | 鍙戝竷浜2012-05-08 涓炬姤| 璇勮 1 0 涓烘偍鎺ㄨ崘: C璇█--鏄粈涔堟剰鎬 缂栬瘧绋嬪簭灞炰簬...
绛旓細void initList(sqlist &La){//鏋勯犱竴涓┖绾挎琛↙ La.elem=(int *) malloc(100 *sizeof(int));//鍒嗛厤绌洪棿 if (!La.elem) exit(-2);//鏈垎閰嶅垯 璺冲嚭锛汱a.length=0;La.listsize= 100 ;} int Listinsert_sq(sqlist &L,int i,int e) // listinsert_sq;鎻掑叆涓涓厓绱 {int *n...
绛旓細printf(" 4.绾挎ф悳绱娉曟悳绱 ");printf(" 5.瀵鍒嗘悳绱㈡硶鎼滅储 ");printf(" 6.鏄剧ず鍏ㄩ儴瀛︾敓鎴愮哗 ");scanf("%d",&x);switch(x){ case 1:Input()
绛旓細浠诲姟鐨勪紭鍏堢骇绛夌骇涓庣浉瀵规埅姝㈡湡銆佺┖闂叉椂闂翠箣闂寸殑灞傛鍏崇郴鍙互鐢ㄤ竴绉绾挎鍏崇郴鏉ユ弿杩,姣斿, di+ksj=g 鍏朵腑,k涓虹嚎鎬у叧绯荤殑鏂滅巼,g 鍙互鐪嬫垚鏄紭鍏堢骇绛夌骇銆瀵逛簬纭畾鐨勬枩鐜噆,g 瓒婂皬,浼樺厛绾х瓑绾ц秺楂樸傛瘮濡,瀵逛簬g1<g2,婊¤冻di+ksj=g1鐨勪换鍔′紭鍏堢骇瑕侀珮浜庢弧瓒砫i+ksj=g2鐨勪换鍔′紭鍏堢骇銆傚浘涓甫绠ご鐨勬枩鍚戜笂鐩寸嚎琛ㄧず涓绉...
绛旓細鍒嗚В娉曪細Dolittle鍒嗚В 锛堟垜鐢ㄧ殑鏄疌ourant鍒嗚В娉曪級锛岃拷璧舵硶锛屽绉版瀹氱煩闃电殑LDL鈥樺垎瑙 --- 杩唬娉曪細Jacobi杩唬 Gauss-Seidel杩唬 鏉惧紱杩唬 --- 浣犱笂缃戝彲浠鎼滅储涓涓嬶紝鎴栬呯湅鐪嬫暟鍊艰绠楁柟闈㈢殑涔 OK, 浣犵湅鐪嬭繖涓, 鍙﹀杩樺姞浜嗘敞閲 锛欳ourant鍒嗚В绠楁硶锛歛X = b, 浣 A=LU, L鏄笅涓夎鐭╅樀锛 U鏄笂涓夎鐭...
绛旓細鐢ㄧ▼搴忓仛涓鍏绾挎鍥炲綊澶勭悊浠ュ強鐢c璇█绋嬪簭鏉ョ敾绮掑害鍒嗗竷鍥剧瓑杩欏嚑鏍锋瘮杈冮噸瑕佺殑鏃堕棿鎿嶄綔銆 涓婃満瀹為獙鏄涔犵▼搴忚璁¤瑷蹇呬笉鍙皯鐨勫疄璺电幆鑺,鐗瑰埆鏄痗璇█鐏垫椿銆佺畝娲,鏇撮渶瑕侀氳繃缂栫▼鐨勫疄璺垫潵鐪熸鎺屾彙瀹冦瀵逛簬绋嬪簭璁捐璇█鐨勫涔犵洰鐨,鍙互姒傛嫭涓哄涔犺娉曡瀹氥佹帉鎻＄▼搴忚璁℃柟娉曘佹彁楂樼▼搴忓紑鍙戣兘鍔,杩欎簺閮藉繀椤婚氳繃鍏呭垎鐨勫疄闄呬笂鏈...
绛旓細1.鎴戜笉鐭ラ亾浣犵殑棰樻剰涓殑璺緞鏄崟鍚戠殑杩樻槸鍙屽悜鐨勶紝涓嶈繃鎴戞妸璺緞璁剧疆鎴愬弻鍚戠殑浜 2.璇翠竴涓嬫垜绋嬪簭鐨勮緭鍏ワ紝棣栧厛杈撳叆涓涓猲锛岃〃绀鸿鍥句腑鏈塶鏉¤矾锛涚劧鍚庢湁n琛岋紝姣忚 涓や釜鏁皒, y锛1<=x, y<=99锛夛紝琛ㄧず杩欎袱涓湴鐐规湁涓鏉¤矾寰勩傛渶鍚庤緭鍏ヤ袱涓暟锛岃〃绀鸿绠楄繖涓ょ偣涔嬮棿鎵鏈夌殑璺緞 3.鎴戠殑鎬濊矾鐢ㄧ殑鏄繁鎼...
绛旓細鍏充簬鏁版嵁缁撴瀯鐨勯棶棰,鐢C璇█鎻忚堪 60 1.璁句竴鍑芥暟f(x,y)=(1+A*(e^B/cos胃)*(1+C*(cos蠄)^2),鍏朵腑胃=(蟺*x)/180,蠄=(蟺*y)/180,鍙傛暟A=-0.5,B=-0.4,C=-0.1銆倄浠0鍙樺寲鍒89,姝ラ暱涓1,y浠0鍙樺寲鍒359,姝ラ暱涓1銆傞噰鐢ㄤ竴绉嶆暟鎹粨... 1. 璁句竴鍑芥暟 f(x,y)=(1+A*(e^B/cos胃)*(1...
