lsearch.c
来源:互联网 发布:twilight软件复读机 编辑:程序博客网 时间:2024/05/17 07:29
<iframe name="google_ads_frame" marginwidth="0" marginheight="0" src="http://pagead2.googlesyndication.com/pagead/ads?client=ca-pub-5572165936844014&dt=1194442938015&lmt=1194190197&format=336x280_as&output=html&correlator=1194442937843&url=file%3A%2F%2F%2FC%3A%2FDocuments%2520and%2520Settings%2Flhh1%2F%E6%A1%8C%E9%9D%A2%2FCLanguage.htm&color_bg=FFFFFF&color_text=000000&color_link=000000&color_url=FFFFFF&color_border=FFFFFF&ad_type=text&ga_vid=583001034.1194442938&ga_sid=1194442938&ga_hid=1942779085&flash=9&u_h=768&u_w=1024&u_ah=740&u_aw=1024&u_cd=32&u_tz=480&u_java=true" frameborder="0" width="336" scrolling="no" height="280" allowtransparency="allowtransparency"></iframe> #include <stdlib.h>
#include <stdio.h>
int compare_int(int *a, int *b)
{
return(*a - *b);
}
void main(void)
{
int int_values[10] = {1, 3, 2, 4, 5};
int *int_ptr, int_value = 1500, elements = 5, i;
printf("Array contents before search/n");
for (i = 0; i < elements; i++)
printf("%d ", int_values[i]);
int_ptr = lsearch(&int_value, int_values,
&elements, sizeof(int),
(int (*) (const void *, const void *)) compare_int);
printf("/nArray contents after search/n");
for (i = 0; i < elements; i++)
printf("%d ", int_values[i]);
}
- lsearch.c
- c语言范式编程之lsearch
- Tcl -- lsearch
- lsearch(线性搜索)
- tcl列表操作lsearch
- bsearch、lsearch and lfind函数
- bsearch、lsearch and lfind函数
- TCL: LIST命令-lsearch, lsort, lrange
- tcl/tk参考——列表操作lsearch
- (2) array of sturct/string: lfind lsearch and insert
- tcl/tk参考——列表操作lsearch
- c
- c
- c
- c
- C
- c
- c
- longout.c
- loopfact.c
- Ajax java 实现用户名自动验证
- lowcopy.c
- lower.c
- lsearch.c
- Ajax java 实现用户名自动验证 (2)
- makepath.c
- make_chng.cpp
- Ajax java 实现用户名自动验证 (3)
- malloc.c
- manipul.cpp
- 端口用途-网摘(备查)
- manip_threads.cpp