70 likes | 225 Views
Final Project Fall 2012. Data Structures and Algorithms Comparative Analysis of Searching Algorithms. Instructor: Dr. Quratulain Rajput Group members 1.Sadiq Ahmad 2. Aamir khan 3.Amjad Khan. Description.
E N D
Final ProjectFall 2012 Data Structures and Algorithms Comparative Analysis of Searching Algorithms. Instructor: Dr. Quratulain Rajput Group members 1.Sadiq Ahmad 2. Aamir khan 3.Amjad Khan
Description • This project provides a comparative analysis of four basic and important searching algorithms on different data size. • Searching algorithms used are • Linear Search • Binary Search • Search in Hashtable • Binary Search tree
Project Design • It runs all the searching algorithms on different data size and writes the result or number of camparisons on an excell workbook • Apache POI is used to write the data. • Apache POI is a pure java library wich is used to creat and manpulate MS office documetns. • From the excell workbook the data can easily be put in bar or line graph. Wchich shows the behaviour of each algorithm.
Some variables used in the program • L_S stands for linear search • B_S stands for binary search • HT_S stands for Hash table search • BT_S stands for Binary tree search. • Data is the size of input data.