Scribd Logo
Upload

Welcome to Scribd!

  • Cse 36

    Uploaded by

    Kamal Hossain
    0 views10 pages
    This document presents a simple C program that implements a binary search algorithm. It contains an introduction to binary search, stating that it works on sorted arrays and eliminates halves of the array at each step based on comparing the target value. It also defines the problem statement as performing binary search on a sorted array and using linear search if unsorted. The presentation outlines include introduction, problem statement, what is binary search, the C code, and output. The C code implementation takes user input of array size and elements, the target value, and uses a while loop to repeatedly compare the middle element to the target and update the search range. The output prints if the target is found and its location or not found.

    Original Description:

    Original Title

    cse-36

    Copyright

    © © All Rights Reserved

    Available Formats

    PPTX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document presents a simple C program that implements a binary search algorithm. It contains an introduction to binary search, stating that it works on sorted arrays and eliminates halves of the array at each step based on comparing the target value. It also defines the problem statement as performing binary search on a sorted array and using linear search if unsorted. The presentation outlines include introduction, problem statement, what is binary search, the C code, and output. The C code implementation takes user input of array size and elements, the target value, and uses a while loop to repeatedly compare the middle element to the target and update the search range. The output prints if the target is found and its location or not found.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    0 views10 pages

    Cse 36

    Uploaded by

    Kamal Hossain
    This document presents a simple C program that implements a binary search algorithm. It contains an introduction to binary search, stating that it works on sorted arrays and eliminates halves of the array at each step based on comparing the target value. It also defines the problem statement as performing binary search on a sorted array and using linear search if unsorted. The presentation outlines include introduction, problem statement, what is binary search, the C code, and output. The C code implementation takes user input of array size and elements, the target value, and uses a while loop to repeatedly compare the middle element to the target and update the search range. The output prints if the target is found and its location or not found.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 10

    Welcome To My Presentation About

    A Simple C Programming
    Presented by
    Robiul Ibne Ali
    ID:CSE-36
    Registration no:17502004435
    Department of Computer Science and Engineering
    Supervised by
    MD.Hemaet Uddin
    Department of Computer Science and Engineering
    Dhaka Commerce College
    Presentation Outlines:

     Introduction
     Problem Statement
     What is binary search algorithm?
     Programming Code
     Output
    Introduction

    ■ Binary search works on sorted arrays. Binary search begins by comparing an element in the
    middle of the array with the target value. If the target value matches the element, its position
    in the array is returned. If the target value is less than the element, the search continues in the
    lower half of the array. If the target value is greater than the element, the search continues in
    the upper half of the array. By doing this, the algorithm eliminates the half in which the
    target value cannot lie in each iteration
    Problem Statement

    ■ Binary search can be performed on a sorted array.


    ■ If the array is unsorted, linear search is used to determine the position.
    What is binary search algorithm?

    A binary search, also known as a half-interval search, is an algorithm used in


    computer science to locate a specified value (key) within an array. For the
    search to be binary, the array must be sorted in either ascending or descending
    order.
    Programming Code
    #include<stdio.h>
    void main()
    {
    int i,n,first,last,middle,search,array[100];
    printf("Enter Number of Elements in array:");
    scanf("%d",&n);
    printf("Enter the Elements in Array:");
    for(i=0;i<n;i++)
    scanf("%d",&array[i]);
    printf("Enter a Number to Search in Array:");
    scanf("%d",&search);
    first=0;
    last=n-1;
    middle=(first+last)/2;
    while(first<=last)
    {

    if(array[middle]<search)
    first=middle+1;
    else if(array[middle]==search)
    {
    printf("%d is found at location %d",search,middle+1);
    break;
    }
    else
    last=middle-1;
    middle=(first+last)/2;
    }
    if(first>last)
    printf("Not found!%d isn't present in the Array",search);
    }
    Output:

    ■ Enter Number of Elements in array:5


    Enter the Elements in Array: 2 3 7 9 8
    Enter a Number to Search in Array:7
    7 is present at location: 3
    🙄
    Any question?
    Thank you

    You might also like