binary search

 #include <stdio.h>

int main() {

    int arr[] = {5, 10, 15, 20, 25, 30, 35, 40, 45, 50};

    int size = sizeof(arr) / sizeof(arr[0]);

    int target = 30;

    int low = 0;

    int high = size - 1;

    int mid;

    int index = -1;

    while (low <= high) {

        mid = low + (high - low) / 2;

        // Check if the target is exactly the middle element

        if (arr[mid] == target) {

            index = mid;

            break;

        }

        // If the target is greater than the middle element, ignore the left half

        if (arr[mid] < target) {

            low = mid + 1;

        }

        // If the target is less than the middle element, ignore the right half

        else {

            high = mid - 1;

        }

    }

    if (index != -1) {

        printf("Element %d found at index %d", target,index);

    } else {

        printf("Not found");

    }

    return 0;

}


Comments

Post a Comment

Popular posts from this blog

Transpose

  #include <stdio.h> int main () {     int m , n ;     printf ( "Enter the number of rows and columns of the matrix: " );     scanf ( " %d %d " , & m , & n );     int matrix [ m ][ n ]; // Original matrix     int transpose [ n ][ m ]; // Transposed matrix     printf ( "Enter the elements of the matrix: \n " );     for ( int i = 0 ; i < m ; i ++ ){         for ( int j = 0 ; j < n ; j ++ ){             printf ( "Enter element [ %d ][ %d ]: " , i , j );             scanf ( " %d " , & matrix [ i ][ j ]);         }     }     // Print the original matrix     printf ( " \n Original Matrix: \n " );     for ( int i = 0 ; i < m ; i ++ ) {         for ( int j = 0 ; j < n ; j ++ ) {         ...
Read more

1 to n without any parameter Recursion

  #include <iostream> using namespace std ; void print ( int n ){     if ( n == 0 ) return ;     print ( n - 1 );     cout << n << endl ; } int main (){     int n ;     cin >> n ;     print ( n ); } //EXPLANATION /* before printing n bar bar call laga rha h same funnction ko 4 se minus hote hote 1 tak gya uske bad jb n 0 hua to return hua aur uske bad jita sara fucntion ko call kiya wo sb phirse run honge kyunki wo sb run pura nhi hua tb jake wo piche se suru hoga print krna phir jb n 1 that wo fnc khtm hoga uske bad jb n 2 tb wo hoga khtm krte krte puche se fnc khtm hoga */
Read more

Recursion Factorial

  #include <stdio.h> int factorial ( int n ) {     if ( n == 0 || n == 1 ){         return 1 ;     } else {         return n * factorial ( n - 1 );     } } int main () {     int n ;     printf ( "Enter no.: " );     scanf ( " %d " , & n );     printf ( " %d " , factorial ( n ));     return 0 ; }
Read more