8

Linear search

  1. #include <stdio.h>
  2.  
  3. static void print( int tab[], const int siz )
  4. {
  5.     int i;
  6.     for ( i=0; i < siz; i++ )
  7.         printf((i < siz-1) ? "%d, " : "%d\n", tab[ i ]);
  8. }
  9.  
  10. int search( int val, int tab[], const int siz )
  11. {   /* linear search */
  12.     int i;
  13.     for ( i=0; i < siz; i++ )
  14.         if ( tab[i] == val )
  15.             return i;
  16.     return -1;
  17. }
  18.  
  19. main() {
  20.     int tab[] = { 5, 8, 2, 9, 1, 6, 4, 3, 7 };
  21.     int siz = sizeof (tab) / sizeof (int);
  22.  
  23.     print( tab, siz );
  24.     printf("1 -> %d\n", search( 1, tab, siz ) );
  25.     printf("0 -> %d\n", search( 0, tab, siz ) );
  26. }

Comments

Your comment:
[p] [b] [i] [u] [s] [quote] [pre] [br] [code] [url] [email] strip help 2000

Enter a maximum of 2000 characters.
Improve the presentation of your text with the following formatting tags:
[p]paragraph[/p], [b]bold[/b], [i]italics[/i], [u]underline[/u], [s]strike[/s], [quote]citation[/quote], [pre]as is[/pre], [br]line break,
[url]http://www.izend.org[/url], [url=http://www.izend.org]site[/url], [email]izend@izend.org[/email], [email=izend@izend.org]izend[/email],
[code]command[/code], [code=language]source code in c, java, php, html, javascript, xml, css, sql, bash, dos, make, etc.[/code].