Dry run below algorithm and find the item (55) in the following array (C).Also write the name of the given algorithm.0 189 1534567C=| 102655444334Igorithm-) Search (C, item)-) low =0=) high=n-1E) while (low s high)low + highmid =2if (item = C[mid]) thenprint ('Search is Successful')else if (item < C[mid]) thenhigh = mid -1else low = mid +1=) print ("Search is unsuccessful")

We are given an algorithm and an example array on which we have to execute this array. We will find…

Dry run below algorithm and find the item (55) in the following array (C). Also write the name of the given algorithm. 0 1 C- 10 3 4 5 7 89 15 26 55 44 43 34 Igorithm -) Search (C, item) >) low = 0 =) high =n-1 1) while (low shigh) low + high =) mid = | 2 if (item = C[mid]) then print ('Search is Successful') else if (item < C[mid]) then high=mid -1 else low = mid +1 -> nrint ("Search is unSuccessful")

Dry run below algorithm and find the item (55) in the following array (C). Also write the name of the given algorithm. 0 1 C- 10 3 4 5 7 89 15 26 55 44 43 34 Igorithm -) Search (C, item) >) low = 0 =) high =n-1 1) while (low shigh) low + high =) mid = | 2 if (item = C[mid]) then print ('Search is Successful') else if (item < C[mid]) then high=mid -1 else low = mid +1 -> nrint ("Search is unSuccessful")

Programming Logic & Design Comprehensive

9th Edition

ISBN:9781337669405

Author:FARRELL

Publisher:FARRELL

Chapter6: Arrays

Section: Chapter Questions

Problem 17RQ

See similar textbooks

Similar questions

A & B answers are given below please Answer C part Algorithm – We are taking first element of array in A Comparing A with other elements of array, if A is smaller then store that element in A otherwise compare with next element The value of A is the answer A Solution 2000 LXI H 2050 H←20, L←50 2003 MOV C, M C←M 2004 DCR C C←C-01 2005 INX H HL←HL+0001 2006 MOV A, M A←M 2007 INX H HL←HL+0001 2008 CMP M A-M 2009 JNC 200D If Carry Flag=0, goto 200D 200C MOV A, M A←M 200D DCR C C←C-1 200E JNZ 2007 If Zero Flag=0, goto 2007 2011 STA 3050 A→3050 2014 HLT Part (b) Pipeline- The pipeline is the implementation technique where multiple instructions are executed simultaneously. It is highly efficient and improves overall performance.In a pipelined processor, the pipeline has two ends the input end and the output end. Between both ends, there are many stages, where one stage is…
Write the algorithm which finds the second maximum value of the array. Then find the complexity of the algorithm as Big O notation
Given a list of scores and a passing score, you are asked to find out the numberof scores which are equal to or higher than the passing score, the lowest score, andthe highest score. For examples, if the list of scores is as follows: 46, 58, 55, 43,89, 93, 77, 82, 99, 64; and if the passing score is 60, then the answers should be 6,43 and 99. Implement the above task using MIPS. Initialize the array of scores inmemory using any integer values between 0 and 100. The passing score should beobtained from user’s input and the answer must be printed out.
Compute the distance between the positions of the first and last zero element in the given array. For example, if the array is 3 0 1 0 4 9 5 0 6 your algorithm should yield 7 - 1 = 6. If the array contains a single zero, return 0. If it doesn't contain any zeroes, return a negative value.
Given the following array of numbers: 8 2 3 9 10 1 4 6 7 5 Show what the array looks like after each iteration of the following sorting algorithms: Bubble Selection Insertion Mergesort Only show the array contents with each algorithm. You do not need to show function call instances if recursion is used or write any code. Just show the array at key iterations of the algorithm. You can use your own words to describe them as well for more detail (but do not write any code). Show what the array looks like after each recursive iteration of the Quicksort algorithm.
Write an algorithm that, given an array, initialises all the elements so that thecontent of each element is the index (i.e. A[i] contains i), then multiplies all theelements of the array together to give the result.
convert this python code into java? Python code is as shown below: # recursive function def row_puzzle_rec(row, pos, visited): # if the element at the current position is 0 we have reached our goal if row[pos] == 0: possible = True else: # make a copy of the visited array visited = visited[:] # if the element at the current position has been already visited then it's a loop. # as then its not possible to reach the last element, set possible to False if visited[pos]: possible = False else: # set visitied for the element as True visited[pos] = True possible = False # if its possible to move left then recurse in the left direction if pos - row[pos] > 0 and row_puzzle_rec(row, pos - row[pos], visited): # return immediately if the goal is reached return True # if its possible to move right then recurse in the right…
The following code is SIMILAR to binary search. However, the element selected for mid in this scenario is NOT the middle array/sub-array element. By looking at the following code, explain the search strategy used by this algorithm (note: the statement mid = low in this scenario). Analyze the performance/time complexity of this method. index location (index low, index high){ index mid; if (low > high) return 0; else { mid = low; if (x == S[mid]) return mid; else if (x < S[mid]) return location(low, mid - 1); else return location(mid + 1, high); } }
Following is the function for interpolation search. This searching algorithm estimates the position (index) of a key in array based on the elements in the first position and last position in the array, and the length of array. The array must be sorted in ascending order. Suppose array A contains the following 15 elements: A = [1, 3, 3, 10, 17, 22, 22, 22, 24, 25, 26, 27, 27, 28, 28] At first iteration, at which position (index) the element of 24 is estimated in array A? In which part of array (starting index and ending index) the searching should continue? How many iterations the searching are performed until the element of 24 is found? int InterpolationSearch(int x[], int key, int n) { int mid, min = 0, max = n-1; while(x[min] < key && x[max] > key) { mid = min + ((key-x[min])*(max-min)) / (x[max]-x[min]); if(x[mid] < key) min = mid + 1; else if(x[mid] > key) max = mid - 1; else return mid; } if…
Implement a Binary Search algorithm, and using the results from Exercise 5, show how longthe Binary Search takes (on average) for arrays of size 10, 100, and 1000. (You do not haveto print out the values in the array).
Design an algorithm to find all pairs of integers within an array which sum to aspecified value.
A square matrix can be represented by a two-dimensional array with N rows and N columns. You may assume a maximum size of 50 rows and 50 columns. 1. Write an algorithm MakeEmpty(n), which sets the first n rows and n columns to zero.2. Write an algorithm Add(M1, M2, M3), which adds two matrices M1 and M2 together to produce matrix M3.3. Write an algorithm Subtract(M1, M2, M3), which subtracts matrix M2 from matrix M1 to produce matrix M3.4. Write an algorithm Copy(M1, M2), which copies matrix M1 into matrix M2. Answer 1 and 2 questions with code