Data structure(Searching linear and binary)
Linear sear ch :-इस Search सर्च में element को एक-एक करके search किया जाता है और जहां element मिल जाता है search complete. (Compare element one by one) Time taking Best Case = O(1) Average Case = O (n) Worst Case Complexity O(n) Assume Find K = 41 Program # Linear Search in Python def linearSearch (array, n, x) : # Going through array sequencially for i in range( 0 , n): if (array[i] == x): return i return -1 array = [ 2 , 4 , 0 , 1 , 9 ] x = 1 n = len(array) result = linearSearch(array, n, x) if (result == -1 ): print ( "Element not found" ) else : print ( "Element found at index: " , result) Binary seach :-( Worked with sorted Array ) हमारे पास elements (a+b/2) को Check किया जाता है और उसके हिसाब से Half parts को eleminate कर दिया जाता है और आगे के Parts को ऐसे ही तरीके से सर्च किया जाता है. Program for Binary Search by iteration a...