JAVA

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. Sorting, like searching, is also a common task in computer programming. It is used to arrange elements in a particular order and is often used to make searching easier. Objective: For this exercise, you will implement, run and test searching and sorting algorithms. You will implementing these algorithms for integer arrays. Instructions : Update the search and sort methods in your "my-work" project folder in IntelliJ to reflect the recursive algorithms described in Week-02-Alogorithms lecture slides. The code should be committed to GitHub and you should have a clear understanding of how each algorithm works. You are to know each of these algorithms on sight (from memory). This will be assessed in a few weeks, so start practicing! Where to find the starter code package > module : modules > recursive > SearchModule package > module : modules > recursive > SortModule jithub-classroom [bot] lic class searchModule \{ 9 usages _github-classroom[bot] public static int binarysearch(int[] data, int target) \{ return binarysearch(data, target, min: , max: data. length 3 usages \& github-classroom[bot] private static int binarysearch(int[] data, int target, int min, int max) \{ int mid; if(min>max){ return - 1; \}else \{ mid=(min+max)/2; if (data [ mid ] target) return binarysearch(data, target, min, max: mid - 1); else return mid; \} \}