Scribd Logo
Upload

Welcome to Scribd!

  • Binary Search in C#

    Uploaded by

    Dev Project PT-BR
    6 views2 pages
    This C# code implements a binary search algorithm to search for a target value within a sorted integer array. It takes the array and target value as arguments, sets initial low and high indexes, calculates the midpoint index on each iteration, and compares the midpoint value to the target, narrowing the search range accordingly until either the target is found or the range is fully iterated without a match.

    Original Description:

    código de binary seach em c#

    Original Title

    binary search in c#

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This C# code implements a binary search algorithm to search for a target value within a sorted integer array. It takes the array and target value as arguments, sets initial low and high indexes, calculates the midpoint index on each iteration, and compares the midpoint value to the target, narrowing the search range accordingly until either the target is found or the range is fully iterated without a match.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    6 views2 pages

    Binary Search in C#

    Uploaded by

    Dev Project PT-BR
    This C# code implements a binary search algorithm to search for a target value within a sorted integer array. It takes the array and target value as arguments, sets initial low and high indexes, calculates the midpoint index on each iteration, and compares the midpoint value to the target, narrowing the search range accordingly until either the target is found or the range is fully iterated without a match.

    Copyright:

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

    using System;

    class binary_search{

    static void Main(){

    int[] list = new int[] {1,2,3,4,5,6,7,8,9,10,20,30,40,50,80};

    Binary(list, 20);

    public static void Binary(Array list, int item)

    //int[] array = n

    //list.AddRange(1,2,3,4,5,6,7,8,9,10,20,30,40,50,80);

    int low = 0;

    int high = list.Length - 1;

    while (low < high){

    float calculo = (low+high) / 2;

    int middle = (int)Math.Round(calculo);

    if(list[middle] == item ){

    Console.WriteLine("o Valor é: ",item, "a posicao é: ",


    middle);

    }else if(list[middle] > item){

    high = high - 1;
    }else {

    low =low + 1;

    Console.WriteLine("Valor não existe no array");

    You might also like