The document presents a project on linear and binary search algorithms by Shanawaz Ahamed, Mahfuza Rahman Mim, and Md Tahsif Ahmed. It outlines the concepts of both algorithms, their implementation using C++ code, execution time measurements, and graphical results produced with MATLAB. Conclusions indicate that while binary search takes longer than linear search, the execution time increases significantly for larger datasets.

1. Project Presentaion.
Linear and Binary Search Algorithms.

2. Shanawaz Ahamed 2016-1-60-103.
.
Mahfuza Rahman Mim 2016-2-60-001
Md Tahsif Ahmed 2016-2-60-117.

3. Outlines:
 Concept of Algorithm.
 The Linear search Algorithm.
 The Binary search Algorithm.
 Code (Flowchart).
 Results.
 Graph(Using MatLab).
 Conclusions.

4. Algorithm
Searching Algorithm
1)The Linear search Algorithm.
2) The Binary search Algorithm.
.

5. List of Random Integers
Randomly chosen an integer number.
Used Linear search
Algorithm to find This
Number.
Used Binary search
Algorithm to find This
Number.
Measured The
Execution Time.
Measured The
Execution Time.
Work Way.

6. Code:
1)C++
2) Object Oriented.
3) Used Array.
4) rand(), function.
5)Clock(), function.
6)Linear Search Algorithm.
7) Binary Search Algorithm

7. Output:
integer 5 as Input.

8. Matlab:
1) Selected integers as independent Variables (x).
2) Time during linear & Binary search input as “y1” and
“y2”.
3) Plot them to get figure.
4) Labeling each axis.

9. Graph:

10. Conclusion:
 Binary Search take more time than linear search.
 For large number program took too much time to execute.
 The graph don’t follow any sequence.

11. Any Query??
Please, feel free to ask …