What is the Big-Oh Runtime (in terms of n) for the following segment of code?   int i; int used[n]; for (i = 0; i < n; i++) {     used[i] = 0; } for (i = 0; i < n; i++) {     if (used[i] == 0) {         used[i] = 1;         i = -1;      } }

Q: What does .compare do in c++? for example in this sorting function void employeeSort(string…

A: Compare: “compare()” function is one of in-built function that is used to compare the strings. It…

Q: OverflowS You have learned the concept of overflow (with say n! that overflows at 13! for integer)…

A: 1 In Java short range is from -32,768 to 32,767  thus when it encounters this full range then the…

Q: Let B be an array of size n >= 6 containing integers from 1 to n – 5, inclusive, with exactly five…

A: The, answer has given below:

Q: A[2] * A[3] - ....etc. For this exercise, we would like to implement two solutions and compare their…

A: Code: #include &lt;stdio.h&gt;#include &lt;stdlib.h&gt;#include &lt;time.h&gt;void solution1(long…

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: Given an array of integers, return a new array such that each element at index i of the new array is…

A: Given:

Q: Consider an implementation of QuickSort that, given an array A[0..n - 1] of n elements, always…

A: Algorithm: quickSort(array, leftmostIndex, rightmostIndex)   if (leftmostIndex &lt; rightmostIndex)…

Q: Consider the following recursive function. What is the output for r2d2(82, 3)? public static int…

A: Outut of he recursive function for r2d2(82,3) is given in step 2.

Q: What is the running time of QUICKSORT when all elements of array A have the same value?

A: What is the running time of QUICKSORT when all elements of array A have the same value?

Q: What is the number of element movements required, to insert a new item at the middle of an…

A: We need to find the correct option for the given questions. *** As per the guidelines only 1st…

Q: Write a program with a loop and indexed addressing that calculates the sum of all the gaps between…

A: Output Screenshot:

Q: Consider the following recursive algorithm: Int active(int x) { if (x < 1) return 10; else return…

A: Given: We are given a program in which we recursion is involved.  Goal: We have to calculate the…

Q: case #5  int i , p =1; for(i=1;i<=n;i++) p = p*i case #6  int rec(int r) { if(r==0) return 1;…

A: Question 1: In both the above given cases case #5 and case #6 their is a case of infinite loop. As…

Q: Recall the insertion sort method shown below. After the ith iteration of the outer loop of the…

A: This question comes from Data Structure which is a paper of computer science. Let's discuss it in…

Q: Given an array of integers, return a new array such that each element at index i of the new array is…

A: Given:

Q: My question is can I write this code in a different and easier way .? Python code: # there is only…

A: The easier presentation of given Python code: def fn(x):     return x**3 - x - 2   # define…

Q: Analysis of PrefixAverages2 cost c, Create an array A such that length[A] = length[X] C2 S+ 0 C3 for…

A: Assuming length of array is n   The loop iterating from 1 to n i.e n times The statements inside the…

Q: Consider the below integer array which is already sorted { 1, 2, 3, 4, 4, 6, 6, 6 } program in Java…

A: import java.util.*;class GFG {  // function to find repeating elements static void…

Q: 4. Complete the quick sort method by supplying code for the following methods: a. insertionSort (int…

A: insertsort(int A[]) {      int i, j, t;      int len = A.length;      for (i = 1; i &lt; len; i++) {…

Q: Write a program Minesweeper.java that takes three integer command-line arguments m, n, and k and…

A: Hello.. Below i have provided there choice for above problem, hope it will help you I've also added…

Q: Write a program that reads integers, finds the largestof them, and counts its occurrences. Assume…

A: Program: import java.util.Scanner; public class Main {    private static int c;    private static…

Q: Write an algorithm that inputs a number n followed by an array of n numbers and outputs the number…

A: an algorithm that inputs a number n followed by an array of n numbers and outputs the number of…

Q: Create a program java then copy the following implementation of this mystery sort to your program:…

A: The MysterySort method actually uses bubble sort algorithm, but not so efficient sorting algorithm.…

Q: Write a program that reads a[8]. Then find and print the repetition of EACH element on it?

A: Given :  To write a program that reads a[8]. Then find and print repetition of each element on it.…

Q: Identify the recursive functions from the given code and give reasons why these functions are…

A: Answer: Given Code:   void mergeSort(int a[],int p,int r) {    int q; if(p&lt;r) { q=(p=r)/2;…

Q: Write a recursive method public static int pos(int[] a, int l,int r) that positions a[l] at its rank…

A: OBJECTIVE: - place the lth index element in the array at the correct position between index l and…

Q: Consider the same code, copied here for reference, but clearly with an array that has no valid…

A: The above problem can be solved by step-by-step writing and considering the values of all variables.…

Q: You are given an array A[1, ., n] in which the elements A[2] to A[n] are already sorted, i.e., A[2,…

A: Algorithm with proper pseudocode

Q: In Python, write a recursive implementation of Fibonacci without memoization. Include a timer to…

A: Python program to solve the given problem is below.

Q: Identify the recursive functions from the given code and give reasons why these functions are…

A: Explanation: Merge Sort works on the principle of divide and conquer rule. To sort a lengthy array,…

Q: What is the worst case running time of Heapsort when the input is an array where all key values are…

A: We are going to understand what will be the time complexity of the hap sort when all its keys are…

Q: Recall the following segment of Java code for computing the set-difference of two given arrays (note…

A: - We have to convert the code from computation of intersection to computation of union of the two…

Q: Using Java, give an algorithm for the following problem: given a list of n distinct positive…

A: Please upvote. I am providing you the correct answer below. Please please.

Q: Implement stack in array implementation using the following code :   #include #include #include…

A: In the given program undo() and redo() are similar to pop() and push() operations on stack. The…

Q: Write a program that reads a list of integers and outputs those integers in reverse. The input…

A:

Q: Write a program that reads the elements of the square matrix A (N, N) where 10 > N, and then does…

A: SUMMARY: - Hence, we got the output.

Q: Rewrite the linearSearch algorithm given below to output all positions of the element x in the array…

A: Here is the modified linearSearch algorithm to output all the positions of element X in array L.…

Q: Consider the given alorithm where A(1:n) is an array of n integers... A) What does the program do?…

A: Please refer below for your reference: Part a) The program finds the largest and smallest elements…

Q: What is the time complexity for the best and worst case of the "Main" applet listed below? What does…

A: Given Code contains some errors so I removed such error and the code is : def Main(array, n,…

Q: Identify the recursive functions from the given code and give reasons why these functions are…

A: A recursive function is a function that calls itself during its execution. The process may repeat…

Q: You want to design an algorithm, called minMax(A,p,r), that takes an array of integers and indexes…

A: Below is the minmax algorithm using divide and conquer technique:

Q: Write a computer program, or code, to calculate the number of partitions p(n) of a finite set of n…

A: code snippet:

Q: Using Java, how do you write the following method un-recursively: public void path2(int q, int r) {…

A: Answer: We have written Non-Recursive function for the given recursive function

Q: What is the complexity of the following code segment (assume all the libraries are included)? int x…

A: The correct option is

Q: Modify the ArrayDeque implementation so that it does not require the modulus (%) operator. The…

A: According to the question, we have to modify the deque array according to the given conditions. In…

Q: Write a function in Python, Haskall, or Picat to remove duplicates from a given list. For example,…

A: Answer: we have written function in python to remove duplicate form the list in time complexity O(n)…

Q: What is the runtime of the following code segments?  Prove that your answer is correct. 1.  void…

A: The solution to the given problem is below.

Q: Create a python code that takes a list and find the sequence of consecutive numbers where the…

A: Program Explanation: Python 3 program to print the absolute difference of the consecutive even and…

Q: [ ]: # write your implementation here def isPrime(n): checks whether the positive integer n, which…

A: here in this question we have asked  to write a program which take  input from user and check for…

Q: Let A[0..n − 1] be an array of n real numbers. A pair (A[i], A[j ]) is said to be an inversion if…

A:

Problems on numbers

Number theory is one of the most appealing topics in mathematics. Given one or more numeric values, a numeric algorithm performs some computation. The use of number theory in computing is important for applications like in the case of cryptographic algorithms. Number theory is also used in various applications such as calculating hash functions or in information security. Euclid’s algorithm is one of the oldest number-theoretic algorithms which is used to calculate the greatest common divisor of two numbers.