FIFA-2022 Career Guide Free Tutorials Go to Your University Placement Preparation 
0 like 0 dislike
5.9k views
in Coding Questions by Goeduhub's Expert (5.8k points)

Some teams qualified for the 2014 World Cup. The score of the teams were stored in an array in sorted order and array index is the represents the team. Index 0 represents the Team 1; index 1 represents the Team 2 and so on.  If a score is given, then should find out which team got that score with a O(log(n)) time.  

 Since Ram wanted to solve this puzzle with binary search and he decided to write binary search himself.  But he cannot remember the logic of binary search .  Help Ram to write the program.

Create the main() inside the class 'BinarySearch'

Function signature : public static int binarySearch(int[] ar,int size,int key)

Input and Output Format:

Refer sample input and output for formatting specifications.

Sample Input and Output 1:

Enter the number of Teams:

5

Enter the score:

12

16

23

45

67

Enter the score to be searched:

23

23 is the score of Team 3

 

Sample Input and Output 2:

Enter the number of Teams:

4

Enter the score:

12

34

45

77

Enter the score to be searched:

59

Score Not Found

1 Answer

0 like 0 dislike
by Goeduhub's Expert (5.8k points)
 
Best answer

Java Program

BinarySearch.java
import java.util.*;
 public class BinarySearch
 {
     public static void main (String[] args) {
         Scanner s=new Scanner(System.in);
         System.out.println("Enter the number of Teams:");
         int num=s.nextInt();
         int arr[]=new int[num];
         System.out.println("Enter the score:");
         for(int i=0;i<num;i++)
         {
             arr[i]=s.nextInt();
         }
         System.out.println("Enter the  score to be searched:");
         int k=s.nextInt();
         binarySearch(arr,0,num-1,k);
     }
     public static void binarySearch(int arr[],int first,int last,int k)
     {
         int mid=(first+last)/2;
         while(first<=last)
         {
             if(arr[mid]<k)
             {
                 first=mid+1;
             }
             else if(arr[mid]==k)
             {
                 System.out.println(k+" is the score of Team "+(mid+1));
                 break;
             }
             else
             last=mid-1;
             mid=(first+last)/2;
         }
         if(first>last)
         System.out.println("Score Not Found");
     }
 }

For any queries refer to comment section

Learn & Improve In-Demand Data Skills Online in this Summer With  These High Quality Courses[Recommended by GOEDUHUB]:-

Best Data Science Online Courses[Lists] on:-

Claim your 10 Days FREE Trial for Pluralsight.

Best Data Science Courses on Datacamp
Best Data Science Courses on Coursera
Best Data Science Courses on Udemy
Best Data Science Courses on Pluralsight
Best Data Science Courses & Microdegrees on Udacity
Best Artificial Intelligence[AI] Courses on Coursera
Best Machine Learning[ML] Courses on Coursera
Best Python Programming Courses on Coursera
Best Artificial Intelligence[AI] Courses on Udemy
Best Python Programming Courses on Udemy

Related questions

0 like 0 dislike
1 answer 7.1k views
asked May 13, 2020 in Coding Questions by Ankit Yadav Goeduhub's Expert (5.8k points)
0 like 0 dislike
1 answer 3.3k views
asked May 13, 2020 in Coding Questions by Ankit Yadav Goeduhub's Expert (5.8k points)
0 like 0 dislike
1 answer 6.2k views
asked May 13, 2020 in Coding Questions by Ankit Yadav Goeduhub's Expert (5.8k points)
0 like 0 dislike
1 answer 2.7k views
asked May 13, 2020 in Coding Questions by Ankit Yadav Goeduhub's Expert (5.8k points)
0 like 0 dislike
1 answer 6.0k views
asked May 13, 2020 in Coding Questions by Ankit Yadav Goeduhub's Expert (5.8k points)

 Important Lists:

Important Lists, Exams & Cutoffs Exams after Graduation PSUs

 Goeduhub:

About Us | Contact Us || Terms & Conditions | Privacy Policy ||  Youtube Channel || Telegram Channel © goeduhub.com Social::   |  | 

 

Free Online Directory

...