AIM: Write a program to do Binary Search using a given Search Key in a Sorted Linear Array 'A' which has N values in it. Description: The binary search algorithm can only be used with sorted array and eliminates one half of the elements in the array being searched after each comparison. The binary search algorithm applied to our array A works as follows: Algorithm: (Binary Search) Here A is a sorted Linear Array with N elements stored in it in sorted order and SKEY is a given item of information to search. This algorithm finds the location of SKEY in A and if successful, it returns its location otherwise it returns -1 for unsuccessful. BinarySearch (A, N, SKEY) [Initialize segment variables.] 1. Set START=0, END=N-1 and MID=int((START+END)/2). 2. Repeat Steps 3 and 4 while START ≤ END and A[MID]+SKEY. 3. If SKEY< A[MID] Then Set END=MID-1. Else Set START=MID+1. [End of If Structure.] Set MID=int((START +END)/2). [End of Step 2 loop.] 5. If A[MID] = SKEY then Else 4. Set LOC = -1 [End of IF structure.] 6. return LOC and End Set LOC= MID

AIM: Write a program to do Binary Search using a given Search Key in a Sorted Linear Array 'A' which has N values in it. Description: The binary search algorithm can only be used with sorted array and eliminates one half of the elements in the array being searched after each comparison. The binary search algorithm applied to our array A works as follows: Algorithm: (Binary Search) Here A is a sorted Linear Array with N elements stored in it in sorted order and SKEY is a given item of information to search. This algorithm finds the location of SKEY in A and if successful, it returns its location otherwise it returns -1 for unsuccessful. BinarySearch (A, N, SKEY) [Initialize segment variables.] 1. Set START=0, END=N-1 and MID=int((START+END)/2). 2. Repeat Steps 3 and 4 while START ≤ END and A[MID]+SKEY. 3. If SKEY< A[MID] Then Set END=MID-1. Else Set START=MID+1. [End of If Structure.] Set MID=int((START +END)/2). [End of Step 2 loop.] 5. If A[MID] = SKEY then Else 4. Set LOC = -1 [End of IF structure.] 6. return LOC and End Set LOC= MID

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter8: Arrays And Strings

Section: Chapter Questions

Problem 15PE

See similar textbooks

Similar questions

Programming Language: C Programming Write a program of sorting an array. Declare single dimensional array and accept 5 integer values from the user. Then sort the input in ascending order and display output. Write a program in C to input size of an array, input and store elements in an array and allow to delete particular element
Python Coding Exercise: Write a function that takes three parameters: a 2-D array arr, a row location i, a column location j and returns a float representing the fraction of neighbors around arr [i,j] # write your function here:def find_frac(arr,i,j):
Assignment Write a program that reads a 2D array of chars, checks, and corrects each char within this array, and print out the corrected 2D array. First the program will read the row count (rowCount) and column count (columnCount) of the 2D array, both as int values. Then, the chars constituting the 2D array will be read on a row-by-row basis. After reading the 2D array, the program will check and correct each char within the 2D array according to the rules below. This process MUST be done by using a void function by sending the appropriate cell of the 2D array with a call-by-reference fashion. • If the row index is an even number, a char can only be a lowercase English value. • If the row index is an odd number, a char can only be ?, 7', or X'. • Any incorrect value MUST be changed into Finally, the checked and corrected 2D array will be printed out to the screen. NOTE: Checking the correctness of a char and correcting it (if necessary) MUST be done in the function with a…
Answer in java script Create a function that returns true if the first array can be nested inside the second. arr1 can be nested inside arr2 if: 1. arr1's min is greater than arr2 's min. 2. arr1's max is less than arr2 's max. Examples canNest([1, 2, 3, 4], [0, 6]) true canNest ([3, 1], [4, 0]) → true canNest ([9, 9, 8], [8, 9]) → false canNest([1, 2, 3, 4], [2, 3]) - false
Best Partition You are given an array of positive numbers of size N and an integer K. You need to partition the array into K continuous segments. For each segment, the sum of its elements needs to be calculated. The segment with the minimum sum is called the bestSegment and the sum of the elements of the bestSegment is called the bestSum. For all possible combinations of partitions of the array when divided into K segments, their bestSum needs to be calculated and the one among them with maximum value needs to be returned. Input Specification: input1: an array of N positive numbers input2: an integer N denoting the length of the array input3: an integer K Output Specification: Return an integer denoting the maximum value of all possible bestSum. Example 1: input1: (1,2,3,4} input2: 4 input3: 2 Output: 4 Explanation: You can partition the given array into 2 continuous segments in the following manner- • 123 14- the sum of individual segments is (6,4) and the bestSum is 4 • 12134- the…
Matrix Multiplication• Write a multiplication function that accepts two 2D numpy arrays,and returns the product of the two. This function should test that thearrays are compatible (recall that the number of columns in the firstmatrix must equal the number of rows in the second matrix). Thisfunction should test the array sizes before attempting themultiplication. If the arrays are not compatible, the function shouldreturn -1. solve in python
Q: Write a program / Pseudo code / Algorithm that inserts the following numbers into two Separate arrays. L1 à 50 30 25 75 82 28 77 L2 à 50 40 25 75 80 21 37 30 After Insertion median should be calculated for each adjacent element from both array structures, after computing median print / Output that array M. if M is the median them M0 = (L1[0]+L2[0]) /2 M1 = (L1[1]+L2[1]) /2 …………..
Matrix Addition• Write an addition function that accepts two 2D numpy arrays, andreturns the sum of the two (if they are the same size). This functionshould test that the arrays are the same size before performing theaddition. If the arrays are not the same size, the function shouldreturn -1. solve in python
C program Create random array with user-defined size Write the CreateNewArray() function, which creates an array of any size and randomly fills it with integers in the interval [min, max). Function inputs: the size of the array (int), a seed value for the random number generator (int), and the values min and max defining the interval [min, max) (both ints). Function outputs: a pointer to the newly created array of integers. main() is mostly written for you. It reads in all inputs from the user, calls CreateNewArray(), and prints the array's entries. However, you will need to add a statement at the end of main() to free the memory that you allocated in CreateNewArray(). Reminder: If you dynamically allocate any memory, you MUST free that memory before the end of your program. Note: Inside CreateNewArray(), use srand() to seed the random number generator and rand() to generate random integers in the interval [0, RAND_MAX]. Both functions are accessible in stdlib.h.
Randomly generate a partially filled array of unique values.a) Create a blank partially filled integer array of capacity 10.b) Implement an array print function.c) Implement a hasValue function which accepts the array and an integervalue as input. It checks the array for the value and returns trueif the value exists, false if it does not.d) Implement a randArray function which initializes the array with randomintegers between 0 and 9 inclusive. This function should use thehasValue function to ensure all values are unique (no duplicates).e) Print the array. Confirm that all values (0-9) are included. Example 1 Output (input in bold italics) 2 5 8 9 3 4 0 1 7 6Example 2 Output (input in bold italics)5 9 3 4 7 0 1 6 2 8
C Program Bubble Sort Write a program that continuously accepts integer user input and assign the value in an array with a size of 100. The input process terminates if either of the following is true: inputted value is 0 input count is greater than 100 Sort the values inside the array in ascending order using the bubble sort algorithm. Print out the sorted values inside the pair of square brackets [ ] where the elements are separated by a comma and a space ", " Input 1. Multiple lines containing an integer Output Enter number 1: 1 Enter number 2: 2 Enter number 3: 3 Enter number 4: 4 Enter number 5: 5 Enter number 6: 0 [1, 2, 3, 4, 5]
In main() for now: do these - one at a time, each in it's own loop (we will make functions out of them later –Declare an array RandArray with 20 integers –Assign each of the 20 values with a random value from 0 to 99 Hint: Use rand()%100 For mimir: Do not call srand at the top of main. // normally: Call srand(time(0)) at the top of main –(you need #include<cstdlib>) –Write another loop that prints the array, with index values Important: If the output values do not match mimir, please add srand(17); // inside your main function - at the top code format: #include <iostream>using namespace std; #include <cstdlib> // required for rand() int main(){ srand(17); // define a constant ARRAYSIZE that is 20 // declare randArray // set the 20 elements in randArray to be a random number between 0 and 99 // hint: use rand()%100 // print the 20 values return 0;}