Posts

Showing posts with the label Searching & Sorting.

All Algorithms of Searching & Sorting in the Best & Easiest way.

SEARCHING  &  SORTING ALGORITHM Linear Search     for(start to end of array) { if (current_element equals to 5) { print (current_index); } }    Time Complexity: O(N) Space Complexity: O(1) Binary Search int binarySearch ( int low , int high , int key ) { while ( low <= high ) { int mid =( low + high )/ 2 ; if ( a [ mid ]< key ) { low = mid + 1 ; } else if ( a [ mid ]> key ) { high = mid - 1 ; } else { return mid ; } } return - 1 ; //key not found }     Time Complexity: O ( log 2 N )  Space Complexity: O(1) Bubble Sort void bubble_sort ( int A [ ], int n ) { int temp ; for ( int k = 0 ; k < n - 1 ; k ++) { // (n-k-1) is for ignoring comparisons of elements which have already been compared in earlier ite...