Suppose you have an array of n elements A = {1,2,3,4,5} total of 5! binary search trees are possible(not necessarily distinct) now my question is in how many of trees 1 appeared as leaf node and in how many 2 appeared as leaf node and so on ? What I have tried: I've seen for A = {1,2,3} 2 ap...

The set of primitive functions and operations The clue it is to find one little subset of operations that allow to write all the remain operation easily, they have to be few (because it is difficult remember too much ) I request to you to add other operation/function you think to be easy and goo...

Bobby's Booby-Trapped Safe Bobby's booby-trapped safe requires an n-digit code to unlock it. Alex has a probe which can test combinations without typing them onto the safe. The probe responds Fail if no individual digit is correct. Otherwise it responds Close, including when all digits are corre...

Algebraic Fibonacci Given two integers starting integers, a, b, the terms of the Fibonacci sequence can be represented as follows: a, b, a+b, a+2b, 2a+3b, 3a+5b, 5a+8b, 8a+13b... The Challenge Your task is to, given an integer n, return the nth Fibonacci number, represented algebraically usi...

Take a byte! Your task is to, given an unsigned integer n, find the largest number which can be created by deleting a single byte (8 consecutive bits) of data. Example Given the number 7831, we first convert it to binary: 1111010010111 We then find the group of 8 bits which, when removed,...

Bitwise XOR of rational numbers code-golf rational-numbers bitwise Introduction Every rational number between 0 and 1 can be represented as an eventually periodic sequence of bits. For example, the binary representation of 11/40 is 0.010 0011 0011 0011 ... where the 0011 part repeats infi...

I want to sort the given array using quicksort. So I wrote this code in c for quicksort algorithm but its not giving me correct answer.Its giving me the same output as the input. eg: If i give input as 3 2 1 then it is giving Output: 3 2 1 Please help and tell me where is the mistake. #include<s...