* Euclid's algorithm (or the Euclidean algorithm) is an algorithmthat computes the greatest common divisor, denoted by gcd, of two integers. Below are the originalversion of Euclid's algorithm that uses repeated subtraction and another one that uses theremainder.int gcd sub (a,b)int gcd rem(a,b)int a,b;int a,b;{{if (!a)int t;return b;while (b)while (b){if (a > b)= b;a = a - b;b =a % b;elseat;b = b - a;}return a;return a;}}1. Trace each of the above algorithm using these values: a=24 and b = 18. Show your work2. Compare both algorithms. That is, which one is better and why? Show your work.

Answered: Image /qna-images/answer/55cfbac3-048e-49ae-8ad5-e859cecdb472.jpg

Euclid's algorithm (or the Euclidean algorithm) is an algorithm that computes the greatest common divisor, denoted by gcd, of two integers. Below are the original version of Euclid's algorithm that uses repeated subtraction and another one that uses the remainder. int gcd_sub (a,b) int a,b; int gcd_rem(a,b) int a,b; { { if (!a) int t; while (b) return b; while (b) { if (a > b) t = b;

Euclid's algorithm (or the Euclidean algorithm) is an algorithm that computes the greatest common divisor, denoted by gcd, of two integers. Below are the original version of Euclid's algorithm that uses repeated subtraction and another one that uses the remainder. int gcd_sub (a,b) int a,b; int gcd_rem(a,b) int a,b; { { if (!a) int t; while (b) return b; while (b) { if (a > b) t = b;

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

Similar questions

Please help me Josephus Problem is a theoretical problem related to a certain counting-out game. On thiscase, people are standing in a circle waiting to be executed. After a specified number ofpeople are skipped, the next person is executed. The procedure is repeated with theremaining people, starting with the next person, going in the same direction and skippingthe same number of people, until one person remains, and is freed.Arrange the numbers 1 , 2, 3 , ... consecutively (say, clockwise) in a circle. Now removenumber 2 and proceed clockwise by removing every other number, among those thatremain, until one number is left. (a) Let denote the final number which remains. Find formula for .(b) If there are 70 people, what is the safe number (the number that remains)?
Write a recursive implementation of Euclid’s algorithm for finding the greatest common divisor (GCD) of two integers. Descriptions of this algorithm are available in algebra books and on the Web. Write a test program that calls your GCD procedure five times, using the following pairs of integers: (5,20), (24,18), (11,7), (432,226), (26,13). After each procedure call, display the GCD.
java Given Array :ARRAY[] = [11, 21, 33, 40, 50]Write a full and complete recursive implementation of the Binary SearchAlgorithm such that you find your target element 21 in O(log2(n)) timecomplexity overall and O(1) space complexity. Here, n is the length ofthe list of input integers (array). We will not be considering any memoryused by recursion.
Computer Science There is an n × n grid of squares. Each square is either special, or has a positive integer costassigned to it. No square on the border of the grid is special.A set of squares S is said to be good if it does not contain any special squares and, starting fromany special square, you cannot reach a square on the border of the grid by performing up, down,left and right moves without entering a cell belonging to S. 5 3 4 9 4 X 3 6 1 9 X 4 1 2 3 5 - Design an algorithm which receives an arbitrary n × n grid, runs in time poly-nomial in n and determines a good set of squares with minimum total cost.
Implement the sieve of Eratosthenes: a function for computing prime numbers, known to the ancient Greeks. Choose an integer n. This function will compute all prime numbers up to, and including, n. First insert all numbers from 1 to n into a set. Then erase all multiples of 2 (except 2); that is, 4, 6, 8, 10, 12, ... . Erase all multiples of 3, that is, 6, 9, 12, 15, ... . Go up to ?⎯⎯√n. The remaining numbers are all primes. Make sure that you use functions in your solution, including a main function. Define def sieveOfEratosthenes(n) that receives the maximum value and returns a list of all prime numbers less than or equal to this value in main() print the list of prime numbers.
You want to design an algorithm, called minMax(A,p,r), that takes an array of integers and indexes of the first and last elements, and returns the minimum and maximum values in that range. Now write the pseudo code of a divide and conquer (and therefore, recursive) algorithm with the same time complexity (Θ(n)). You can assume that p ≤ r. Also, in your code, you can return two numbers by returning a pair, e.g. “return (a, b)”, and can save the output in a similar way, e.g. “(a, b) = minMax(parameters)”. (Short answer please)
The Binary Search algorithm works by testing a mid-point, then eliminating half of the list. In this exercise, you are going to take our binary search algorithm and add print statements so that you can track how the search executes. Inside of the recursive binary search function, add print statements to print out the starting, ending, and midpoint values each time. Then as you test a value, print out the results, either too high, too low, or a match. Sample Output Starting value: 0 Ending value: 9 Testing midpoint value: 4 Too high! Starting value: 0 Ending value: 3 Testing midpoint value: 1 Too low! Starting value: 2 Ending value: 3 Testing midpoint value: 2 Match!
C++ What is the code below doing? Find the short code can replace its function (For example: sort, replace, search, ...) int* Algorithm1(int limit){bool* sieve = new bool[limit >> 1];for (int i = 0; i < sizeof(sieve) / sizeof(sieve[0]); i++) sieve[i] = true;for (int p = 3, s = 9; s < limit; p += 2){if (sieve[p >> 1]){for (int q = s; q < limit; q += p << 1)sieve[q >> 1] = false;}s += (p + 1) << 2;}int* primes = new int[sizeof(sieve) / sizeof(sieve[0])];if (limit > 2)primes[0] = 2;for (int i = 1; i < sieve.size(); ++i){if (sieve[i])primes.push_back((i << 1) + 1);}return primes;}
The Tower of Hanoi is a puzzle where n disks of different sizes arestacked in ascending order on one rod and there are two other rods with nodisks on them. The objective is to move all disks from the first rod to thethird, such that:- only one disk is moved at a time- a larger disk can never be placed on top of a smaller oneWrite a recursive function that outputs the sequence of steps needed tosolve the puzzle with n disks.Write a test program in C++ that allows the user to input number of disks andthen uses your function to output the steps needed to solve the puzzle.Hint: If you could move up n−1 of the disks from the first post to thethird post using the second post as a spare, the last disk could be moved fromthe first post to the second post. Then by using the same technique you canmove the n−1 disks from the third post to the second post, using the firstdisk as a spare. There! You have the puzzle solved. You only have to decidewhat the nonrecursive case is, what the recursive…
Write a program that reads two matrices of integers. It then generates the sum, difference and productof the two matrices.The sum of the two matrices of the same size is a matrix with elements that are the sums of thecorresponding elements of the two given matrices. Addition is not defined for matrices of different sizes.If A and B are matrices of the same size, then we define subtraction as follows: A – B = A + (-B). Thus, tosubtract matrix B from matrix A, we simply subtract corresponding elements.To multiply a matrix by another matrix we need to do the "dot product" of rows and columns. The "DotProduct" is where we multiply matching members, then sum up:(1, 2, 3) • (7, 9, 11) = 1×7 + 2×9 + 3×11 = 58We match the 1st members (1 and 7), multiply them, likewise for the 2nd members (2 and 9) and the3rd members (3 and 11), and finally sum them up.
Write a Java program that• Define an integer array with length of 10.• Populate the array with random integer numbers.• Sort this array into non-decreasing order based on three sorting algorithms.o bubble sorto selection sorto insertion sort• Test these 3 sorting methods• Give a big-Oh characterization, in terms of n, of the running time of these three algorithms.• I mprove the bubble sort so that the time complexity of them are O(N) for the best case Write a Java program that• Define an integer array with length of 100.• Populate the array with random numbers in {1, 2, ..., 30}.• Count and output the frequency of each number occurred in the array.• Give a big-Oh characterization, in terms of n, of the running time of this algorithm.
solve in java Integer arrays originalArr and filterArr are read from input, each containing two elements. If an element in originalArr is not a multiple of the corresponding element in filterArr, replace the element in originalArr with the corresponding element in filterArr times 2. Ex: If the input is: 16 9 8 4 then the output is: 16 8 Note: Given integers A and B, A is a multiple of B only if A % B == 0. 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 import java.util.Scanner; public class ReplaceNumbers { publicstaticvoidmain(String[] args) { Scannerscnr=newScanner(System.in); finalintNUM_VALS=2; int[] originalArr=newint[NUM_VALS]; int[] filterArr=newint[NUM_VALS]; inti; for (i=0; i<NUM_VALS; ++i) { originalArr[i] =scnr.nextInt(); } for (i=0; i<NUM_VALS; ++i) { filterArr[i] =scnr.nextInt(); } /* Your code goes here */ for (i = 0; i < originalArr.length; ++i) { System.out.print(originalArr[i] + " "); } System.out.println();…