Need help please on this discrete math problem Moe, Larry, and Curly have just purchased three new computers and use three different algorithms to sort lists:| | Comparisons / sec | Search Algorithm | \( T(n) \) ||---------------|-------------------|------------------------|------------|| Moe | 50 | Linear Search | \( n \) || Larry | 5 | Optimal Chunk Search | \( 2\sqrt{n} \) || Curly | 1 | Binary Search | \( \log_2 n \) |where \( T(n) \) is the number of comparisons it takes, in the worst case, to sort a list of size \( n \).How large must \( n \) be to ensure that, for every list, ... iii. Curly's computer sorts faster than Larry's?(Note: There are no graphs or diagrams in the image.)

Actually, in sorting the elements are in order,(ascending or descending).Solution ;-Moe, Larry, and Curly have just purchased three new computers. Moe’s computer is 10 times faster than Larry’s and 50 times faster than Curly’s. For parts of this problem, you will have to solve an equation that involve (or ) and . Such equations typically cannot be solved analytically, i.e., by applying the rules of algebra to obtain a formula for . Such equations are often solved numerically by using binary search! Consider the equation- First, find two initial values of , one of which causes the left-hand side of the equation to exceed the right, and the other of which causes the right-hand side of the equation to exceed the left. The solution to the equation lies somewhere between these two values. For example, when = 2, the left-hand side of the equation is 10 while the right-hand side is 2. Conversely, when = 128, the left-hand side is 70 while the right-hand side is 128. The solution to this equation lies somewhere between = 2 and = 128. One could then apply binary search in this range to find the solution in question. (Think about which half of the interval one should search and why.)

Engineering

Computer Science

Moe, Larry and Curly have just purchased three new computers and use three different algorithms to sort lists: T(n) Search Algorithm Linear Search Comparisons / sec Moe 50 (l EST Larry Curly Optimal Chunk Search 2n log2 n 1 Binary Search where T(n) is the number of comparisons it takes, in the worst case, to sort a list of size n. How large must n be to ensure that, for every list, ...

Moe, Larry and Curly have just purchased three new computers and use three different algorithms to sort lists: T(n) Search Algorithm Linear Search Comparisons / sec Moe 50 (l EST Larry Curly Optimal Chunk Search 2n log2 n 1 Binary Search where T(n) is the number of comparisons it takes, in the worst case, to sort a list of size n. How large must n be to ensure that, for every list, ...

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter16: Searching, Sorting And Vector Type

Section: Chapter Questions

Problem 6PE

See similar textbooks

Related questions

Q: The acceleration due to gravity at the surface of the moon is approximately 1/6 of the earth's. The…

A: I have provided a solution in step2.

Q: c. {w| w has an even number of a's and one or two b's} Ad. {w| w has an even number of a's and each…

A: C. Consider the language L= { w|w has even number of a’s and one or two b’s}. The language L is…

Q: ecide whether the two sequences of operations will give the same results. Adding two numbers x…

A: Lets take an example for both the sequence lets take x=5 and y=2 1st sequence Adding two numbers…

Q: Matlab A rocket is launched vertically and at t-0, the rocket's engine shuts down. At that time, the…

A: Here is the matlab code.

Q: What would you do if you were trying to figure out what an error number meant on a computer?

A: If you encounter an error number on your computer, it can be frustrating and confusing to figure out…

Q: This question seems wrong the answer should be 23.

A: SOLUTION -A pipeline is a method of executing many instructions simultaneously.In pipelined…

Q: Q5\A) The Amplitude Modulation (AM) is a technique used in communication for transmitting…

A: Fs = 800e3; dt = 1/Fs; t = (0:dt:0.002-dt)'; Fm = 5000; y = cos(2*pi*Fm*t); figure;…

Q: QUESTION 3a: Use MATLAB to solve the following equation without using the symbolic toolbox: y=x² -…

A: The complete matlab code is below:

Q: Describe how to use arithmetic operators.

A: Arithmetic operators: Arithmetic operators take numerical values (either literals or variables) as…

Q: Please use Python

A: The Java program for the given problem is as follows: import java.util.*; import…

Q: Flow chart and algorithm to print sum of n numbers

A: Flowchart

Q: MATLAB provide the code for the following problem: given the (x,y) coordinates of a point, compute…

A: The input() function is used to prompt the user to enter the x and y coordinates. The sqrt()…

Q: Which of the following is done last in the order of operations? Squaring Addition Multiplication…

A: Addition Explanation in order of operation first the parantgesus will get solve than expinenets than…

Q: Python Programming Topic - Generator expressions Write a program that demonstrates a generator…

A: Leibniz formula states that, the following 1-13+15-17+19-....=π4 is an alternating series. This…

Q: Domain Name Generator Using Python Programming Language, your program will create a program called…

A: Code in Python Language:

Question

Need help please on this discrete math problem

Moe, Larry, and Curly have just purchased three new computers and use three different algorithms to sort lists:

| | Comparisons / sec | Search Algorithm | \( T(n) \) |
|---------------|-------------------|------------------------|------------|
| Moe | 50 | Linear Search | \( n \) |
| Larry | 5 | Optimal Chunk Search | \( 2\sqrt{n} \) |
| Curly | 1 | Binary Search | \( \log_2 n \) |

where \( T(n) \) is the number of comparisons it takes, in the worst case, to sort a list of size \( n \).

How large must \( n \) be to ensure that, for every list, ...

iii. Curly's computer sorts faster than Larry's?

(Note: There are no graphs or diagrams in the image.)

Expert Solution

This question has been solved!

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

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 2 steps with 10 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

Binary search has several benefits over sequential search, but how do you choose which algorithm to use?
Question in image Please explain the algorithm with the answer. Python programming
You, Alice and Bob are working on recursive search algorithms and have been studying a variant of binary search called trinary search. Alice has created the following pseudocode for this algorithm: TSearch (A[a...b], t) If a b return -1 Let p1= a + Floor ((b-a)/3) If A[p1] t return p1 If A[p1]> t return TSearch (A[a...p1-1], t) Let p2 = a + Ceiling (2(b-a)/3) If A[p2] = t return p2 If A[p2]> t return TSearch (A [p1+1...p2-1],t) Return TSearch (A [p2+1...b],t) EndTSearch a) State a recurrence relation that expresses the number of operations carried out by this recursive algorithm when called on an input array of size n. b) Bob has heard that trinary search is no more efficient than binary search when considering asymptotic growth. Help prove him correct by using induction to show that your recurrence relation is in (log₂ n) as well. i. Split the tight bound into and upper (big-O) and lower (big-1). ii. For each bound select a function from (log₂ n) to use in your proof, like alog₂ n or…
cs 1
Python numpy library functions to perform basic matrix operations are as follows.• C=numpy.add(A, B): Add two matrices A and B and store result in C.• C=numpy.subtract(A, B): Subtract matrix B from matrix A and store result in C.• C=numpy.divide(A, B): Divide matrix A by matrix B and store result in C.• C=numpy.multiply(A, B): Multiply matrix A by matrix B and store result in C.• C=numpy.sum(A): Form the sum of elements of matrix A and store result in c ∈ R.• C=numpy.sum(A, axis = 0): Form the column wise summation of matrix A andstore result in vector C.• C=numpy.sum(A, axis = 1): Form the row wise summation of matrix A, storeresult in vector C.Python code to show the implementation of these methods in a sample matrix.
Random list indexes (python) + FLOW CHART
Quick sort is the quickest and most efficient sorting algorithm available, using the least amount of auxiliary storage space.
Problem2: A square matrix can be represented by a two-dimensionalarray 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.
#### Part 1 Write a Python function (`binary_search`) that implements the binary search algorithm. This function will take a list argument (`values`), a value to search for (`to_find`), a start index (`start_index`), and an end index (`end_index`). The function will return `True` if `to_find` is present in `values`, and `False` otherwise. Below, you will find some code to test your binary search: ```python values = [2,4,6,8,10,12,14,16,18,20] print(binary_search(values, 14, 0, len(values) - 1)) print(binary_search(values, 7, 0, len(values) - 1)) ``` The output of the test code is below: ``` True False ``` #### Part 2 Modify your `binary_search` function to count the number of comparisons (==, <, <=, >, or >=). The function will now return both the number of comparisons made and the `True` or `False` result. The code below calls your function, and creates a simple ASCII bar chart of the number of comparisons (divided by 10, to account for small differences). Some…
calculate number of operations in this algorithm #include <string.h> #include <stdlib.h> #include <stdio.h> #include <omp.h> const char* dgemv_desc = "OpenMP dgemv."; /* * This routine performs a dgemv operation * Y := A * X + Y * where A is n-by-n matrix stored in row-major format, and X and Y are n by 1 vectors. * On exit, A and X maintain their input values. */ void my_dgemv(int n, double* A, double* x, double* y) { #pragma omp parallel { int nthreads = omp_get_num_threads(); int thread_id = omp_get_thread_num(); printf("Hello world: thread %d of %d checking in. \n", thread_id, nthreads); } // insert your dgemv code here. you may need to create additional parallel regions, // and you may want to comment out the above parallel code block that prints out // nthreads and thread_id so as to not taint your timings #pragma omp parallel for // insert your code here: implementation of basic matrix multiply…
Assume you have the following list of integer numbers. Show a list the numbers which will be successively selected for comparisons when a binary search algorithm is searching for number 42. 1, 7, 15, 18, 21, 26, 32, 42, 43, 49, 54, 59, 60, 67, 71, 77, 81
Multidimensional Array Enhanced For-loop Input Scanner method using Case-statements Simple AI as machine input 1. Declare a multidimensional array of char to draw a table -+-- -+-+- 2. Use the enhanced for-loop to display the table for (char[] row:charName) for (char c:row) System.out.print(c); } System.out.println (); 3. Initialize some value (inside the table) in the array charName [0] [0] '1'; 4. Using Scanner for user input and case statement to put some character inside the table Scanner scan = new Scanner (System.in); int pos = scan.nextInt (); 5. Create some method/function to be used to add functionality to the application program. 6. Add simple AI (for machine input) 7. Using Arraylist to scan patterns in the multidimensional array.