Bhavya Sikri 101706048 ECE2
DSA Assignment
Ques. Select two searching algorithms with Big O(n) and Big O(n^2) and
compare them with the help of an example. Write the pseudo code too.
Big O(n) : Searching algorithm with time complexity O(n) is such that we go to each entry and
look for the required entry such that in Linear Searching. In it running time increases linearly
with the size of the input data
For value in data:
Print(value)
For Example: Imagine a class of 50 students in which you gave your notebook to one person.
Now you want that notebook back, therefor you go to each student and ask them individually.
Pseudo Code: LinearSearch(list,ReqEntry)
{
Int i = 0
While (i<number of items in the list)
{
If (list[i] == ReqEntry)
{
Return i
}
i++
}
Return -1
}
