Question

Unit 4 Assignment 5: Coding Project using C#

Binary Search

Scenario

Use the same integer array named partNumbers that you used for task 3. Sort the array in ascending order.

1065, 1095, 1075, 1055, 1056, 1090, 1098, 1088, 1097, and 1078.

Java: use Array.sort()

C#: use Array.Sort()

PHP: use sort()

Write code that asks the user to enter two part numbers. For C#, use console input.

Implement a binary tree search function called binarySearch() to search the array for the part number entered. Use the following variable names: use a variable named x to represent the array passed to the function and an integer variable named key to represent the key being searched for.

Pass to this function the array partNumbers, the lower array index, the upper array index, and the variable key.

Define an integer variable in the binarySearch function called position. Use this variable for the value of the index of the middle position.

If the part number is found, display to the console the index that part number is in.

Depending on whether or not the part number exists, display to the console that the part number is or is not in stock.

To test your program and get the expected output, enter 1088 for the first value and 1067 for the second value.

Expected Output

The part number was found at index 5.

1088 is in stock.

Answer 1

Please find the answer below, all the details are mentioned in the comments.

Program.cs

using System;

//main class
public class Program{
   static public void Main (){
       //array to hold the part numbers
       int[] partNumbers = { 1065, 1095, 1075, 1055, 1056, 1090, 1098, 1088, 1097, 1078};
      
       //Sort the array first
       Array.Sort(partNumbers);
      
       //get the 2 part input from the user
       int part1 = Convert.ToInt32(Console.ReadLine());
       int part2 = Convert.ToInt32(Console.ReadLine());
      
       //get the index from the binarySearch function
       int index = binarySearch(partNumbers,0,partNumbers.Length-1,part1);
      
       //if element is present then index would be some value else -1
       if(index != -1){
       Console.WriteLine("The part number was found at index " + index + ".");
       Console.WriteLine(part1 + " is in stock.");
       } else{
       Console.WriteLine(part2 + " is not in stock.");
       }
      
       //search for the second part from the user
       index = binarySearch(partNumbers,0,partNumbers.Length-1,part2);
       if(index != -1){
       Console.WriteLine("The part number was found at index " + index + ".");
       Console.WriteLine(part2 + " is in stock.");
       } else{
       Console.WriteLine(part2 + " is not in stock.");
       }
      
   }
  
   //function for the binary Search
   static public int binarySearch(int [] x, int lower, int upper, int key){
   //to check if the valid partition is possible or not
   if(lower < upper){
   //get the middle element of the array
   int position = (lower) + (upper - lower) / 2;
   //if middle element is greater then the key then Search in the lower part
   if(x[position] > key){
   return binarySearch(x,lower,position,key);
   }
   //if middle element is lesser then the key then Search in the upper part
   else if(x[position] < key){
   return binarySearch(x,position + 1,upper,key);
   }
   //if middle element is the key then return the index
   else if(x[position] == key){
   return position;
   }
   // else return -1
   return -1;
   }
   // else return -1
   return -1;
   }
}

Output:

Please let us know in the comments if you face any problems.