Step 1: Select any four sorting algorithm and three searching algorithms

Step 2: Understand the logic of all the algorithms

Step 3: Create java program and use your sorting/searching source codes and integrate it into your main java project.

Step 4: Create a separate java class for each algorithm

Step 5: Create a random function that generates at least 100000 random integer numbers from 1 to 1 million(No need to print out or store the numbers)

Step 6: Insert start transaction and end transaction for each sorting and searching methods

Step 7: Calculate the time in milliseconds for each sorting and searching class

Step 8: Compare the performance of each algorithm Project Deliverables - Determine the best and worst sorting and searching algorithm - Submit only a single word document with all the screenshots - Output screeshot that shows the transaction time for each algorithm - 7 class files for sorting and searching algorithm - 1 class file with main function - Conclusion - No power points only source code