File tree Expand file tree Collapse file tree
Expand file tree Collapse file tree Original file line number Diff line number Diff line change 1+ #include "stdlib.h"
2+
3+ int LinearSearch (int * array , int len , int key ){
4+ int i ;
5+
6+ if (array == NULL ){
7+ return -1 ;
8+ }
9+
10+ for (i = 0 ; i < len ; i ++ ){
11+ if (array [i ] == key ){
12+ return i ;
13+ }
14+ }
15+
16+ return -1 ;
17+ }
Original file line number Diff line number Diff line change @@ -35,7 +35,7 @@ Inverse Fast Fourier Transform | | | | | :+1: | | | |
3535Johnson algorithm | :+1 : | :+1 : | | | :+1 : | | | |
3636Kadane's algorithm | :+1 : | :+1 : | | | :+1 : | :+1 : | :+1 : | |
3737Knuth Morris Prath Algorithm | :+1 : | :+1 : | | | :+1 : | | | |
38- LinearSearch | :+1 : | :+1 : | | | :+1 : | :+1 : | | | | |
38+ LinearSearch | :+1 : | :+1 : | | : +1 : | :+1 : | :+1 : | | | | |
3939Longest-Common-Subsequence | :+1 : | :+1 : | | | :+1 : | | | | :+1 :
4040Longest-Increasing-Subsequence | :+1 : | | | | :+1 : | | | |
4141LongestPath | | | | | :+1 : | | | |
You can’t perform that action at this time.
0 commit comments