Q3. Trace the following code and write the output and mention what the code does int algorithm(int arr(), int I, int r, int x) { if (r >= 1) { int mid = |+ (r - 1) / 2 if (arr[mid] == x) return mid if (arr[mid] > x) return algorithm(arr, I, mid - 1, x) return algorithm(arr, mid + 1, r, x) return -1 int main(void) { int arr[] = { 2, 3, 4, 10, 40, 7, 9, 11)} int n = sizeof(arr)/ sizeof(arr[0]) int x = 11 int output = algorithm(arr, 0, n - 2, x) (output == -1) ? printf(" 11 is not found in the list") : printf("11 is found at index %d", output) return 0

Q3. Trace the following code and write the output and mention what the code does int algorithm(int arr(), int I, int r, int x) { if (r >= 1) { int mid = |+ (r - 1) / 2 if (arr[mid] == x) return mid if (arr[mid] > x) return algorithm(arr, I, mid - 1, x) return algorithm(arr, mid + 1, r, x) return -1 int main(void) { int arr[] = { 2, 3, 4, 10, 40, 7, 9, 11)} int n = sizeof(arr)/ sizeof(arr[0]) int x = 11 int output = algorithm(arr, 0, n - 2, x) (output == -1) ? printf(" 11 is not found in the list") : printf("11 is found at index %d", output) return 0

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Q: Do not use static variables to implement recursive methods. USING JAVA Indicate the order of the…

A: Algorithm: Define an integer n as the value to be used for comparing the growth…

Q: Int func1 (int m, int n){ if (n==1) return m; return m * func(m,n-1); } What does this func1 do?…

A: A recursive function is a kind of function that calls itself until a base case is reached.

Q: 1 import math 2- #Function I: 3- def func1(n): count = 0 sum = 0 34567 7 8 ∞ O 9 10 for i in…

A: Import the math module. Define three functions: a. func1 takes a number n as input and calculates…

Q: Consider the following code fragment: static int f(int[ ] arr, int x ) { int start = 0; int end -…

A: EXPLANATION: The Big O notation is a mathematical notation that represents a function's limiting…

Q: Correct the code to output the following: 0 1 2 3 4 5 6 7 8 9 CODE: int[] numbers = new int[10];…

A: Java Code is given, int[] numbers = new int[10]; for(int i=0; i < numbers.length; ++i)…

Q: Count the number of occurrences of substrings "baba" or "mama" * in the input string recursively.…

A: Algorithm: Start the program. Read the string and substring to find. Using split function find the…

Q: Fix the Java code below: Make sure to have the right code indentation Make sure the "Main"…

A: Actually given code there was a problem with the main function and all the remaining code was…

Q: Using the code posted below add code so it can plays multiple rounds of hangman using simple codes.…

A: This code has small issues for printing the round number. I have edited the code and attached the…

Q: (1) Prompt the user to enter a string of their choosing. Store the text in a string. Output the…

A: Since there are multiple subparts, the first three subparts are answered for you. If you want the…

Q: Complete the following sorting program with bubble sort algorithm. #include using namespace std;…

A: Here is the c++ Code: See below steps:

Q: correct the syntax errors using System; class GFG { void KMPSearch(string pat, string txt)…

A: Correcting the C++ code for pattern searching

Q: PYTHON: create a function code(n) that sorts a list of words alphabetically using a RECURSIVE…

A: Please find the answer below :

Q: 14 What is the output of the following codes int arr[10] = {2,7,5,2,7,9,4,5,2,3}; int count[10] =…

A: In this question we have been given a program and we need to determine the output of the given…

Q: The function 'CountWords' is given below to find the number of words in a sentence. Which of the…

A: ANS: - The correct option is D. if((P[i]==' '&&P[i+1]!=' ')||P[i] =='\0') It checks if the…

Q: What is the value of sum? int w = 5; int sum = 0; for (int r = 1; r <= w; r++) for (int s = r; s <=…

A: int w = 5;int sum = 0;for (int r = 1; r <= w; r++)for (int s = r; s <= w; s++)sum = sum + s;…

Q: 30.2 LAB: Reverse a string Write a recursive function called reverse_string() that takes in a string…

A: The solution to the given problem is below.

Concept explainers

Computational Systems

The computation systems can be defined as the systems that are capable of solving a problem that includes calculations either mathematical or logical, and are able to produce the result as an output. For example, a simple calculator that is given a set of numbers and operators as input and produces the result as an output can be defined as a computational system. The above example is a simple illustration only, the computational systems range from simple devices to complex devices such as the systems that control the SpaceX companies, Starlink satellites which are being quite recently seen in the skies at many places globally.

Question

Q3. Trace the following code and write the output and mention what the code does
int algorithm(int arr[], int I, int r, int x)
{
if (r >= 1) {
int mid = I+ (r - I) / 2
if (arr[mid] == x)
return mid
if (arr[mid] > x)
return algorithm(arr, I, mid - 1, x)
return algorithm(arr, mid + 1, r, x)
}
return -1
}
int main(void)
{
int arr[] = { 2, 3, 4, 10, 40, 7, 9, 11}
int n = sizeof(arr) / sizeof(arr[0])
int x = 11
int output = algorithm(arr, 0, n - 2, x)
(output == -1) ? printf(" 11 is not found in the list")
: printf("11 is found at index %d",
output)
return 0

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Step 3

VIEW

Step by step

Solved in 3 steps with 3 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

Q5. What is the time complexity of following code? int a for (i = 0; ii; j--) { a = a + i + j; } 0; } Q6. What is the time complexity of following code? int i, j, k = 0; for (i = n/2; i <= n; i++) { for (j = 2; j <= n; j = j * 2) { k=k+n/2; } }
I need the code from start to end with no errors and the explanation for the code ObjectivesJava refresher (including file I/O)Use recursionDescriptionFor this project, you get to write a maze solver. A maze is a two dimensional array of chars. Walls are represented as '#'s and ' ' are empty squares. The maze entrance is always in the first row, second column (and will always be an empty square). There will be zero or more exits along the outside perimeter. To be considered an exit, it must be reachable from the entrance. The entrance is not an exit.Here are some example mazes:mazeA7 9# # ###### # # ## # # #### # ## ##### ## ########## RequirementsWrite a MazeSolver class in Java. This program needs to prompt the user for a maze filename and then explore the maze. Display how many exits were found and the positions (not indices) of the valid exits. Your program can display the valid exits found in any order. See the examples below for exact output requirements. Also, record…
JAVA Language: Transpose Rotate. Question: Modify Transpose.encode() so that it uses a rotation instead of a reversal. That is, a word like “hello” should be encoded as “ohell” with a rotation of one character. (Hint: use a loop to append the letters into a new string) import java.util.*; public class TestTranspose { public static void main(String[] args) { String plain = "this is the secret message"; // Here's the message Transpose transpose = new Transpose(); String secret = transpose.encrypt(plain); System.out.println("\n ********* Transpose Cipher Encryption *********"); System.out.println("PlainText: " + plain); // Display the results System.out.println("Encrypted: " + secret); System.out.println("Decrypted: " + transpose.decrypt(secret));// Decrypt } } abstract class Cipher { public String encrypt(String s) { StringBuffer result = new…
int arr[] = {-2, -4, 8, 4, 3, 3, -9};In Java with this given this array, how would this version of Divide and Conqueror be implemented in this case, specifically?
Q5. Find the time complexity of the following code int b = 0; for (j = 0; jj; i--) { b=b+j+i;