Scribd Logo
Upload

Welcome to Scribd!

  • Binary Search Class 10 Java

    Uploaded by

    kom14786
    5 views2 pages
    The document describes binary search, an algorithm for finding a target value within a sorted array. It defines a Java class that takes in an integer array and target value, initializes variables to track the search range and result, and uses a while loop to repeatedly calculate a mid-point and shrink the search range until either the target is found or the range is exhausted. The class prints whether the target was found and avoids common mistakes like omitting semicolons.

    Original Description:

    Original Title

    Binary Search class 10 java

    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
    The document describes binary search, an algorithm for finding a target value within a sorted array. It defines a Java class that takes in an integer array and target value, initializes variables to track the search range and result, and uses a while loop to repeatedly calculate a mid-point and shrink the search range until either the target is found or the range is exhausted. The class prints whether the target was found and avoids common mistakes like omitting semicolons.

    Copyright:

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

    Binary Search Class 10 Java

    Uploaded by

    kom14786
    The document describes binary search, an algorithm for finding a target value within a sorted array. It defines a Java class that takes in an integer array and target value, initializes variables to track the search range and result, and uses a while loop to repeatedly calculate a mid-point and shrink the search range until either the target is found or the range is exhausted. The class prints whether the target was found and avoids common mistakes like omitting semicolons.

    Copyright:

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

    Binary Search

    package array;
    import java.util.Scanner;
    //given array is sorted
    //sorted in ascending order
    public class binarysearch {
    public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int[] arr = {1, 3, 5, 7, 9, 21, 43, 45, 47, 48, 49, 54, 56, 57, 59,
    65, 67, 78, 79, 82, 84, 87, 90, 94};
    int n = arr.length;
    int target = sc.nextInt();
    boolean flag = false;
    int start = 0, end = n - 1, mid;
    while (start <= end)
    {
    mid = (start + end) / 2;
    if (arr[mid] < target) start = mid + 1;
    else if (arr[mid] > target) end = mid - 1;
    else {
    flag = true;
    break;
    }
    }
    if (flag==true)
    System.out.println("ELEMENT FOUND");
    else {
    System.out.println("ELEMENT NOT FOUND");

    }
    }
    }

    Mistakes needed to avoided :-

    While me semi colon nahi daalna h

    Else me bracket daalna hi hoga


    Linear Search
    package array;

    import java.util.Scanner;

    public class linearsearch {


    public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int[] arr = {4,5,6,67,65,54,34};
    System.out.println("ENTER THE SEARCH NO");
    int target = sc.nextInt();
    int no;
    int n = arr.length;
    boolean present = false;
    for (int i = 0; i < n; i++) {
    if (arr[i] == target) {
    present = true;
    break;
    }
    }
    if (present==true) {
    System.out.println("Element found at position");
    }
    else{
    System.out.println("Element not found");
    }

    }
    }

    You might also like