Requirements:
1.
Searching
(Linear and Binary) techniques
2.
File
operation (to read values) (Ref: http://www.oocities.org/manzur_bd/data_structure/lab5.html)
1.
Develop
two programs (Linear and binary searching).
2.
They
will read data from INPUT FILE (make a file and store integers over there)
And return ‘index/position’ or ‘not found’
information.
ADDITIONAL (for good programmers) :
3.
Develop
a time function which will calculate the required time to do that operation.
LAB TASK:
Show the developed programs.
NEXT
WEEKS TASK (Instructor will discuss in class)
Get
ideas of ‘mapping techniques of different types of Matrices to 1-dim array (
refer: http://www.oocities.org/manzur_bd2004/array_presentation.html
).
YOU may be given a typical matrix and you will make
a C code to map it into 1-dim array.