Objective: For this exercise, you will implement, run and test searching and sorting algorithms. You will implementing these algorithms for integer arrays.

Part $1$: Search Algorithms

Searching is the process of looking for a specific element in a data structure such as an array. It is a common task in computer programming.

Instructions:

You will be given the method bodies of two famous searching algorithms the "Sequential" Search a$.$k$.$a "Linear" Search algorithm and the binary search algorithm in your $"$my$-$

lab" starter code. You must complete the method body implementations and submit the code to your GitHub repository $($in the cloud$)$ for grading. You can test whether you

have the right implementation of the code by running the "JUNITO$1$QQSearchTest".

Task Check List

You must complete both the Iterative and Recursive Search Algorithms to complete this part of the lab.

You must update search methods in the following locations in your local "mylab" repository src $>$ algorithms $>$ Iterative and src $>$ algorithms $>$ Recursive $...$You will not

be graded otherwise and will receive a $0,$ if not uploaded there.

Run JUNIT TEST and take a SNAPSHOT of results.

You will upload this along with the other snapshots and handouts as one PDF to this Assignment's Submission page.

Failure to upload Snapshots on JUnit results in a $20\%$ deduction on ANY LAB regardless of not stated explicitly. This is to ensure what is seen on the instructor's side,

when running from GitHub.

NOTES

You should have a clear understanding understanding of how each algorithm works. Drawing out how items are processed in the array for successive iterations will help

with this.

Try to write out the code yourself, because you are expected to know each of these algorithms on sight $($from memory$).$

This will be assessed throughout the course, so start getting in the habit of drawing things out!