Search results
17 paź 2010 · This is a simple example of a function with complexity O (n!) given an array of int in parameter and an integer k. it returns true if there are two items from the array x+y = k , For example : if tab was [1, 2, 3, 4] and k=6 the returned value would be true because 2+4=6. boolean response = false;
19 lut 2019 · base is the number that you want to power up, n is the power, we return 1 if n is 0, and we return the base if the n is 1, if the conditions are not met, we use the formula base*(powerN(base,n-1)) eg: 2 raised to to using this formula is : 2(base)*2(powerN(base,n-1)).
24 wrz 2024 · Time Complexity: O (2*n) = O (n), as we are traversing the array only once. Auxiliary space: O (1), as no extra space is required. [Expected Approach] One Pass Search – O (n) Time and O (1) Space. The idea is to keep track of the largest and second largest element while traversing the array.
5 gru 2023 · Write a Java program to check whether an integer is a power of 2 or not using O(1) time. Note: O(1) means that it takes a constant time, like 12 nanoseconds, or two minutes no matter the amount of data in the set. O(n) means it takes an amount of time linear with the size of the set, so a set twice the size will take twice the time.
16 lip 2024 · Finding whether a given number is a power of 2 using the modulo & division operator: Keep dividing the number by two, i.e, do n = n/2 iteratively. In any iteration, if n%2 becomes non-zero and n is not 1 then n is not a power of 2. If n becomes 1 then it is a power of 2.
27 gru 2023 · Write a function to check whether two given strings are anagrams of each other or not. An anagram of a string is another string that contains the same characters, only the order of characters can be different. For example, “abcd” and “dabc” are an anagram of each other.
28 lut 2020 · Best way to calculate powers of 2 in Java. Asked 4 years, 8 months ago. Modified 4 years, 8 months ago. Viewed 8k times. 1. Given an integer n, find 2^n. Here are two methods I know: Method 1. int a = 1; for(int i = 0; i < n; ++i) a = a << 1; Method 2. int a = Math.pow(2,n);
