searching array

Big O Notation

  It gives rate of growth of step count function(f(n)) in terms of simple function(g(n)) and defines the asymptotic upper bound on function(Fig 1). To simplify the estimation for running time,constants and lower order terms are ignored. The function needs to satisfy following conditions in order to be in Big-O class.Given functions f(n) and g(n),we… read more »

Linear Search

Searching in an array refers to finding the location of a particular element in the given array. It can be done in two ways : Linear Search Binary Search Linear Search It is done by comparing each and every element of array with the data item for which index needs to be found.The data item… read more »