The best search programs to attempt writing in C are the following: Linear search (simplest), Binary search (faster) Hash search (fastest).
execution
You first learn how to program in C.
First, install a C-compiler.
Search for BGIDEMO.C in your TurboC. There are thousands. Many Unix/Linux graphics programs are written mainly in C or C++, including X itself.
first think of the logic and then write the statements
execution
pro c language to implement linear search using pointers
You first learn how to program in C.
For first find an example program.
By learning how to program on C+.
First, install a C-compiler.
yes
if it is n already compiled binary program: ./program-name if it is a code, gcc program-code.c -o program-name if gcc is not installed, on debian: search for a deb package and install it, or, apt-get install gcc on redhat: search for an rpm package and install it.
Search for BGIDEMO.C in your TurboC. There are thousands. Many Unix/Linux graphics programs are written mainly in C or C++, including X itself.
first think of the logic and then write the statements
Ask via an internet search engine; it will find vendors for you.
/* C program for binary search: This code implements binary search in */ /* C language. It can only be used for sorted arrays, but it's fast as */ /* compared to linear search. If you wish to use binary search on an */ /* array which is not sorted then you must sort it using some sorting */ /* technique say merge sort and then use binary search algorithm to */ /* find the desired element in the list. If the element to be searched */ /* is found then its position is printed. */ #include<stdio.h> main() { int c, first, last, middle, n, search, array[100]; printf("Enter number of elements\n"); scanf("%d",&n); printf("Enter %d integers\n", n); for ( c = 0 ; c < n ; c++ ) scanf("%d",&array[c]); printf("Enter value to find\n"); scanf("%d",&search); first = 0; last = n - 1; middle = (first+last)/2; while( first <= last ) { if ( array[middle] < search ) first = middle + 1; else if ( array[middle] == search ) { printf("%d found at location %d.\n", search, middle+1); break; } else last = middle - 1; middle = (first + last)/2; } if ( first > last ) printf("Not found! %d is not present in the list.\n", search); return 0; }