Path: ~/src/com/uoh/LinearSearch.java

Path: ~/src/com/uoh/BinarySearch.java

Path: ~/src/com/uoh/BubbleSort.java

Path: ~/src/com/uoh/QuickSort.java

Path: ~/src/com/uoh/MatrixMultiplication.java

Path: ~/src/com/uoh/ChainedMatrixMultiplication.java

Path: ~/src/com/uoh/TowersOfHanoi.java

Path: ~/src/com/uoh/Prefix2PostfixTree.java

Time taken by each algorithm for 1 million records:

• Programs with time complexity O(n*n) work well for data elements less than 100,000 and beyond that they stop responding
• Programs with time complexity O(2 ^ n) work well for data elements less than 1000 and beyond that they throw errors
• Recursive programs use stack space extensively and so either go into "Stack overflow exception" or "Out of memory error" for data elements more than 1000
• Loop invariants for Bubble Sort and Quick Sort consume a time complexity of O(n)
• Time complexity of loop invariants have no impact on the overall time complexity of Bubble Sort, Quick Sort algorithms

Go to ~/src directory using command cd ./src

Compile the java programs using command javac com/uoh/*.java

Run any algorithm using command java com.uoh.<Algorithm name; eg: LinearSearch>

Running a program with additional memory settings java -Xms2048m -Xmx4096m com.uoh.<Algorithm name; eg: LinearSearch>

Install the latest stable (not beta) version of the IntelliJ

Open the project using IntelliJ: File -> Open

Open any of the algorithm in src/com/uoh directory

Right click on the opened file and click on run option (or) just press Control+Shift+F10