Done
This commit is contained in:
parent
a04a66c509
commit
add23e123e
23 changed files with 1041 additions and 107 deletions
|
|
@ -3,7 +3,7 @@
|
|||
* ---------------------------------------------------------
|
||||
* Exercise Number: S07
|
||||
* Title: Linear search implementation
|
||||
* Author: */<your name>;/*
|
||||
* Author: Marc Tismonar
|
||||
* ----------------------------------------------------------
|
||||
* Description:
|
||||
* Implements the linear search algorithm
|
||||
|
|
@ -24,7 +24,7 @@
|
|||
* @return The index of the `needle` within the list or a value less than zero
|
||||
* if the needle was not not found.
|
||||
*/
|
||||
<type> linear_search_list(<params>);
|
||||
int linear_search_list(IntList haystack, int needle);
|
||||
|
||||
|
||||
/* ARRAY VARIANT */
|
||||
|
|
@ -38,6 +38,6 @@
|
|||
* @return The index of the `needle` within the array or a value less than zero
|
||||
* if the needle was not not found.
|
||||
*/
|
||||
<type> linear_search_array(<params>);
|
||||
int linear_search_array(int haystack[], int length, int needle);
|
||||
|
||||
#endif
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue