C++ , Count number of steps for the following pseudocode(show work) along with calculating the time...
C++ , Count number of steps for the following pseudocode(show work) along with calculating the time complexity(the Big O Efficiency). Thank you!
def LeftToRight(char* diskTest, int size)
if disks = 0:
return none
else
numOfmoves = 0;
for i from 0 to n-1
for j from 0 to 2n-1
if (diskTest[j] is 1 and diskTest [j+1] is 0)
swap (disk[j] and disk[j+1])
increment moves
Return moves
Homework Answers
Add Answer to:
C++ , Count number of steps for the following pseudocode(show
work) along with calculating the time...
Consider the following pseudocode: Algorithm RecursiveFunction (a, b) // a and b are integers if (as1...
Consider the following pseudocode: Algorithm RecursiveFunction (a, b) // a and b are integers if (as1 ) return b; else return RecursiveFunction (a-2, a/2); endif a. What is the time complexity of the RecursiveFunction pseudocode shown above? b What is the space complexity of the RecursiveFunction pseudocode shown above? n(n+1) C. What is the time complexity of the following algorithm (Note that 21-, i = n(n+1)(2n+1). and Σ.,1 ): Provide both T(n) and order, Ofn)). int A=0; for (int i=0;i<n;i++)...
Show your work Count the number of operations and the big-O time complexity in the worst-case...
Show your work Count the number of operations and the big-O time complexity in the worst-case and best-case for the following code int small for ( i n t i = 0 ; i < n ; i ++) { i f ( a [ i ] < a [ 0 ] ) { small = a [ i ] ; } } Show Work Calculate the Big-O time complexity for the following code and explain your answer by showing...
Convert the following pseudocode to Java. Use the same variable names as those in the pseudocode....
Convert the following pseudocode to Java. Use the same variable names as those in the pseudocode. You may assume that the incoming array contains int values and that a swap method exists elsewhere. The variables low and high represent indices in the array. In a comment before the sort method, list which sorting algorithm is used here and what its runtime complexity is in Big-O notation. This is the only comment required for this code. SUBROUTINE sort(ARRAY a[0..n], low, high)...
Question No.1 [CLO 1][7 marks] 1. Consider the following pseudocode: Algorithm IterativeFunction (a, b) // a...
Question No.1 [CLO 1][7 marks] 1. Consider the following pseudocode: Algorithm IterativeFunction (a, b) // a and b are integers while (a>0) B- a/2 A a-2 end while return b; i. What is the time complexity of the IterativeFunction pseudocode shown above? ii. What is the space complexity of the IterativeFunction pseudocode shown above? 2. What is the time complexity of the following algorithm (Note that n(n+1) 2,2 n(n+1)(2n+1) 2 and ): Provide both T(n) and order, e(f(n)). int A=0;...
4. Big-Oh and Rune time Analysis: describe the worst case running time of the following pseudocode...
4. Big-Oh and Rune time Analysis: describe the worst case running time of the following pseudocode functions in Big-Oh notation in terms of the variable n. howing your work is not required (although showing work may allow some partial t in the case your answer is wrong-don't spend a lot of time showing your work.). You MUST choose your answer from the following (not given in any particular order), each of which could be re-used (could be the answer for...
Show the Big O Complexity of the following functions and loop constructions: (Please show work and...
Show the Big O Complexity of the following functions and loop constructions: (Please show work and explain) a. f(n) = 2n + (blog(n+1)) b. f(n) = n * (log(n-1))/2 c. int sum = 0; for (int i=0; i<n; i++) sum++; for (int j=n; j>0; j /= 2) sum++; d. int sum = 0; for (int i=n; i>0; i--) for (int j=i; j<n; j *= 2) sum++;
Which big-O expression best characterizes the worst case time complexity of the following code? public static...
Which big-O expression best characterizes the worst case time complexity of the following code? public static int foo(int N) ( int count = 0; int i1; while (i <N) C for (int j = 1; j < N; j=j+2) { count++ i=i+2; return count; A. O(log log N) B. O(log N2) C. O(N log N) D. O(N2)
Prove Big O in terms of nₒ and C? There are 5 examples: class Exercise {...
Prove Big O in terms of nₒ and C? There are 5 examples: class Exercise { public static int example1(int[] arr) { int n = arr.length, total = 0; for (int j=0; j < n; j++) // loop from 0 to n-1 total += arr[j]; return total; } public static int example2(int[] arr) { int n = arr.length, total = 0; for (int j=0; j < n; j += 2) // note the increment of 2 total += arr[j]; return...
Problem with C++ program. Visual Studio say when I try to debug "Run-Time Check Failure #2...
Problem with C++ program. Visual Studio say when I try to debug "Run-Time Check Failure #2 - Stack around the variable 'string4b' was corrupted. I need some help because if the arrays for string4a and string4b have different sizes. Also if I put different sizes in string3a and string4b it will say that those arrays for 3a and 3b are corrupted. But for the assigment I need to put arrays of different sizes so that they can do their work...
without coding Give the Big O run-time of the following algorithms. Binary Search: def binary-search (arr,...
without coding
Give the Big O run-time of the following algorithms. Binary Search: def binary-search (arr, low, high, x): # Check base case if low > high : return None else: mid = (high + low) // 2 element arr[mid] == X: if element return mid elif element > X: return binary-search(arr, low, mid 1, x) else: return binary_search(arr, mid + 1, high, x) Selection Sort: def selection_sort (arr): for i in range (len(arr)): smallest index = i smallest value...
Consider the following pseudocode: Algorithm RecursiveFunction (a, b) // a and b are integers if (as1 ) return b; else return RecursiveFunction (a-2, a/2); endif a. What is the time complexity of the RecursiveFunction pseudocode shown above? b What is the space complexity of the RecursiveFunction pseudocode shown above? n(n+1) C. What is the time complexity of the following algorithm (Note that 21-, i = n(n+1)(2n+1). and Σ.,1 ): Provide both T(n) and order, Ofn)). int A=0; for (int i=0;i<n;i++)...
Question No.1 [CLO 1][7 marks] 1. Consider the following pseudocode: Algorithm IterativeFunction (a, b) // a and b are integers while (a>0) B- a/2 A a-2 end while return b; i. What is the time complexity of the IterativeFunction pseudocode shown above? ii. What is the space complexity of the IterativeFunction pseudocode shown above? 2. What is the time complexity of the following algorithm (Note that n(n+1) 2,2 n(n+1)(2n+1) 2 and ): Provide both T(n) and order, e(f(n)). int A=0;...
4. Big-Oh and Rune time Analysis: describe the worst case running time of the following pseudocode functions in Big-Oh notation in terms of the variable n. howing your work is not required (although showing work may allow some partial t in the case your answer is wrong-don't spend a lot of time showing your work.). You MUST choose your answer from the following (not given in any particular order), each of which could be re-used (could be the answer for...
Which big-O expression best characterizes the worst case time complexity of the following code? public static int foo(int N) ( int count = 0; int i1; while (i <N) C for (int j = 1; j < N; j=j+2) { count++ i=i+2; return count; A. O(log log N) B. O(log N2) C. O(N log N) D. O(N2)
without coding
Give the Big O run-time of the following algorithms. Binary Search: def binary-search (arr, low, high, x): # Check base case if low > high : return None else: mid = (high + low) // 2 element arr[mid] == X: if element return mid elif element > X: return binary-search(arr, low, mid 1, x) else: return binary_search(arr, mid + 1, high, x) Selection Sort: def selection_sort (arr): for i in range (len(arr)): smallest index = i smallest value...
Most questions answered within 3 hours.
-
Problem: Patient Fees C++
You are to write a program that computes a patient’s bill for...
asked 29 minutes ago -
In a population of interest, we know that, 77% drink coffee, and
23% drink tea. Assume...
asked 55 minutes ago -
Given that f(x) = e-(x-1) for x > 1, determine the following
probabilities:
a) P(X <...
asked 39 minutes ago -
A mechanic pushes a 2.60 ✕ 103-kg car from rest to a speed of v,
doing...
asked 41 minutes ago -
International information systems result in all of the following
except:
A. improved quality of information flow....
asked 35 minutes ago -
The president of the retailer Prime Products has just approached
the company’s bank with a request...
asked 42 minutes ago -
If the carrying amount is $200,000 and recoverable amount is
$205000, the impairment amount is:
Select...
asked 47 minutes ago -
The correlation is inappropriate as a measure of association
between two quantitative variables (you may select...
asked 52 minutes ago -
USE THE DATA IN THE TABLE BELOW TO ANSWER QUESTIONS 19 – 24
(Assume all account...
asked 54 minutes ago -
Mahaley, Inc., manufactures and sells two products: Product Q9
and Product F0. Data concerning the expected...
asked 1 hour ago -
To measure the current through one branch of a parallel circuit,
the meter is connected ________....
asked 1 hour ago -
a)
The following table shows the profile, by the math section of
the SAT Reasoning Test,...
asked 1 hour ago