computer-science

Since Hex (base 16) uses 0-9A-F, and (I'm assuming here) Base 17 uses 0-9A-G and so on. What symbols are used once 0-9A-Z are all used up. There is no standard answer for your question. "Base 36" is coincidentally convenient to talk about because: Hexadecimal conventionally uses 0-9a-f, so it's "obvious" to keep going through the alphabet. The Roman/ASCII alphabet runs out of steam at 'z'. Base 36 (regardless of how you represent it) is mildly interesting from a Mathematical perspective because 36 has so many divisors. However, there's no universally-accepted convention for what sequence of

This question was migrated from Mathematics Stack Exchange because it can be answered on Stack Overflow. Migrated 6 years ago . Solving a quadratic equation I have the following written down so far. I am not sure on how to introduce the second method public static void main(string args[]){ } public static double quadraticEquationRoot1(int a, int b, int c) (){ } if(Math.sqrt(Math.pow(b, 2) - 4*a*c) == 0) { return -b/(2*a); } else { int root1, root2; root1 = (-b + Math.sqrt(Math.pow(b, 2) - 4*a*c)) / (2*a); root2 = (-b - Math.sqrt(Math.pow(b, 2) - 4*a*c)) / (2*a); return Math.max(root1, root2);

What s the difference between a recursive set and recursive function? Josef Grahn Recursive functions and recursive sets are terms used in computability theory. Wikipedia defines them as follows: A set of natural numbers is said to be a computable set (also called a decidable, recursive, or Turing computable set) if there is a Turing machine that, given a number n, halts with output 1 if n is in the set and halts with output 0 if n is not in the set. A function f from the natural numbers to themselves is a recursive or (Turing) computable function if there is a Turing machine that, on input n,

Suppose I have two arrays and I want to merge them so that the merged array has the minimum amount of repetitions . For example [ 'x', 'x' ] is a repetition. arr1 = [ 'x', 'd', 'd', 'm', 'f', 'm' ] arr2 = [ 'd', 'd', 'x', 'f', 'f', 'm' ] The only condition is that in the merged array, the elements from arr1 and arr2 must appear in their respective orders within arr1 and arr2 . Below is an example of the merged array with 0 repetitions while maintaining this condition. merged = [ 'd', 'x', 'd', 'x', 'd', 'f', 'd', 'm', 'f', 'm', 'f', 'm' ] I'm trying to relate this problem to popular dynamic

Closed. This question is off-topic . It is not currently accepting answers. Want to improve this question? Update the question so it's on-topic for Stack Overflow. Closed 7 years ago . I know that the r-1 complement for r-base number should do end around carry if the highest bit has carry. But I cannot figure out why it should do it. I merely can think about it is the reason may be about the two representations for zero. ex: 1 1 1 0 (-1) 0 1 0 1 (+5) =============== 10 0 1 1 =====>(0 1 0 0) I just can explain it from the result that because its sum is positive, and 1's complement has two