Here is the requirement of a problem: Implement int sqrt(int x). Compute and return the truncated square root of x. x is guaranteed to be a non- negative integer. Example 1: Input: 4 Output: 2 Example 2: Input: 8 Output: 2 Explanation: The square root of 8 is 2.82842.., and since we want to return an integer, the decimal part will be truncated. Here is the solution of one programmer: class Solution { public int mysqrt(int x) { if (x == 0) return 0; int left = 1, right = x, ans=right; while (left <= right) { int mid = left + (right - left) / 2; if (mid >= x / mid) { right = mid - 1; ans = mid; } else { left = mid + 1; } } return ans; } } Do you think the above solution is correct? If not, why?

Here is the requirement of a problem: Implement int sqrt(int x). Compute and return the truncated square root of x. x is guaranteed to be a non- negative integer. Example 1: Input: 4 Output: 2 Example 2: Input: 8 Output: 2 Explanation: The square root of 8 is 2.82842.., and since we want to return an integer, the decimal part will be truncated. Here is the solution of one programmer: class Solution { public int mysqrt(int x) { if (x == 0) return 0; int left = 1, right = x, ans=right; while (left <= right) { int mid = left + (right - left) / 2; if (mid >= x / mid) { right = mid - 1; ans = mid; } else { left = mid + 1; } } return ans; } } Do you think the above solution is correct? If not, why?

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter8: Arrays And Strings

Section: Chapter Questions

Problem 24PE

See similar textbooks

Similar questions

Write a program that reads from stdin and filters out duplicate lines of input. It should read lines from stdin, and then print each unique line along with a count of how many times it appeared. Input is case-sensitive, so “hello” and “Hello” are not duplicates. There can be an arbitrary number of strings, of arbitrary length. Note that only adjacent duplicates count, so if the input were the lines “hello”, “world”, and “hello” again, all three would be treated as unique. ./uniqhellohellohelloworldworld^D # close stdin3 hello2 world ./uniqhelloworldhello^D # close stdin1 hello1 world1 hello
Write a library of static methods that performs various geometric transforms on polygons. Mathematically, a polygon is defined by its sequence of vertices (x0, y 0), (x 1, y 1), (x 2, y 2), …. In Java, we will represent a polygon by storing the x– and y-coordinates of the vertices in two parallel arrays x[] and y[]. Three useful geometric transforms are scale, translate and rotate. Scale the coordinates of each vertex (x i, y i) by a factor α. x‘i = α xi y‘i = α yi Translate each vertex (x i, y i) by a given offset (dx, dy). x‘i = xi + dx y‘i = yi + dy Rotate each vertex (x i, y i) by θ degrees counterclockwise, around the origin. x‘i = xi cos θ – yi sin θ y‘i = yi cos θ + xi sin θ Write a two-dimensional transformation library by implementing the following API: public class PolygonTransform { // Returns a new array object that is an exact copy of the given array. // The given array is not mutated. public static double[] copy(double[] array) // Scales the polygon by the factor…
Implement the first round of AES ( Advanced Encryption Standard ) in python. Given a message with 128 bits, two subkeys subkey0 and subkey1, your program should be able to perform one AddKey before Round 1 and the corresponding operations (SubBytes, ShiftRows, Mix-Columns, and AddKey) in Round 1, and output the result of the encryption after Round 1.
Do it in python. There are given a non-negative number x, the decimal portrayal of which contains n digits. You need to shading every its digit in red or dark, with the goal that the number shaped by the red digits is detachable by A, and the number framed by the dark digits is distinct by B. Somewhere around one digit should be shaded in every one of two tones. Consider, the include of digits shaded in red is r and the include of digits hued in dark is b. Among all potential colorings of the given number x, you need to yield any to such an extent that the worth of |r−b| is the base conceivable. Note that the number x and the numbers shaped by digits of each tone, may contain driving zeros. instance of painting the number x=02165 of n=5 digits for A=3 and B=13. The red digits structure the number 015, which is detachable by 3, and the dark ones — 26, which is distinguishable by 13. Note that the outright worth of the distinction between the counts of red and dark digits is 1, it is…
In python 3 We all know that when the temperature of a metal increases, it begins to expand. So,we experimented with exposing a metal rod to different temperatures and recorded itslength as follows:Temp 20 25 30 35 40 45 50 55 60 65Length 0.5 1.8 5 6 6.2 6.5 7.8 9.4 9.8 10.9 Now do these requirments: 1) Implement and plot a simple linear regression for the above data, where the temperature is “x”, and the length is “y” 2) Implement and plot a multiple linear regression "Polynomial regression" with different degrees.For example, Degree of 3:Y = w1x1 + w2x2 + w3x3 + w4Where w4 represents bias.*you can use a normal equation to calculate ‘W’ as follow:W = (XT.X)-1.(XT.Y)Then calculate Y, Where Y = X.WT 3) Try degrees of 2, 3, 5, and 8
Write an improved version of the chaos . py program from Chapter 1 thatallows a user to input two initial values and the number of iterations, and then prints a nicely formatted table showing how the values changeover time. For example, if the starting values were . 25 and . 26 with 10iterations, the table might look like this: index 0.25 0.26----------------------------1 0 . 731250 0 . 7503602 0 . 766441 0 . 7305473 0 . 698135 0 . 7677074 0 . 821896 0 . 6954995 0 . 570894 0 . 8259426 0 . 955399 0 . 5606717 0 . 166187 0 . 9606448 0 . 540418 0 . 1474479 0 . 968629 0 . 49025510 0.118509 0 . 974630
I have no idea how to do this problem Write a library of static methods that performs various geometric transforms on polygons. Mathematically, a polygon is defined by its sequence of vertices (x0, y 0), (x 1, y 1), (x 2, y 2), …. In Java, we will represent a polygon by storing the x– and y-coordinates of the vertices in two parallel arrays x[] and y[]. // Represents the polygon with vertices (0, 0), (1, 0), (1, 2), (0, 1). double x[] = { 0, 1, 1, 0 }; double y[] = { 0, 0, 2, 1 }; Three useful geometric transforms are scale, translate and rotate. Scale the coordinates of each vertex (x i, y i) by a factor α. x‘i = α xi y‘i = α yi Translate each vertex (x i, y i) by a given offset (dx, dy). x‘i = xi + dx y‘i = yi + dy Rotate each vertex (x i, y i) by θ degrees counterclockwise, around the origin. x‘i = xi cos θ – yi sin θ y‘i = yi cos θ + xi sin θ Write a two-dimensional transformation library by implementing the…
Implement the two parallel programs below in Python using mpi4py. 1. Compute ∫" ?!?? based on the Trapezoidal rule. Choose the value of n as 10, # 100, 1000, and 10000, respectively, and compare it with the theoretical value of the integral. Submit your code, and a screenshot of the outputs of running the code with different values of n above and the theoretical value of the integral.
Write a python program: In the first century AD, Nicomachus suggested in his book entitled Introduction Arithmetica that “Cubical numbers can always be represented as the sum of successive odd numbers.” For example, 1^3= 1 = 1 2^3 = 8 = 3 + 5 3^3 = 27 = 7 + 9 + 11 4^3 = 64 = 13 + 15 + 17 + 19 Input N and output the successive odd integers whose sum is i^3 for all i in the set { 1,2,..,N } .
Translate the pseudocode in Section 2.4 for computing the number of tiles and the gap width into Java. number of pairs = integer part of (total width - tile width) / (2 x tile width)number of tiles = 1 + 2 x number of pairsgap at each end = (total width - number of tiles x tile width) / 2 I'm wondering why this test failed, during another test, it was good because the gap was 1.00. Is there something I should do in terms of rounding?
Write a program Minesweeper.java that takes three integer command-line arguments m, n, and k and prints an m-by-n grid of cells with k mines, using asterisks for mines and integers for the neighboring mine counts (with two space characters between each cell). To do so, Generate an m-by-n grid of cells, with exactly k of the mn cells containing mines, uniformly at random. For each cell not containing a mine, count the number of neighboring mines (above, below, left, right, or diagonal)
write a computer program in java that draws a line and circle based on the screenpixels. As we learned, drawing these primitives can be achieved usingdifferent Algorithms. Initially, the program should ask the user to enter 1 todraw a line or 2 for the circle. (1) If the user entered 1, the program should prompt the user to enter the firsttwo endpoints of the line (x1, y1) as well as the second endpoints (x2, y2).before drawing the line, the program should ask the user to choose the desiredalgorithm A: Bresenham's Algorithm or B: DDA Algorithm. Finally, theprogram should draw the line based on the pixels shown on the screen usingthe chosen Algorithm. (2) For the circle, the program should prompt the user to enter the radius ofthe circle, the coordinate of the circle center (h,k), as well as the first point onthe circumference (if needed). Before drawing the circle, the program shouldask the user to choose the desired Algorithm: A: Bresenham's Algorithm, B:Trigonometric method, and…