Advertisements So I have two sorted vectors and I wanted to merge them into a single sorted vector without using an additional vector. Since there’s this condition I can’t use std::merge, so I tried std::inplace_merge. I have this function which takes both vectors and two numbers m and n which are the number of elements… Read More Complexity of std::inplace_merge
Advertisements Suppose we have the function below: def foo(nums): nums = sorted(nums) return nums In our function, we overwrite our original parameter nums, by storing the sorted version of the input in it. My question is simple: does overwriting the input count toward auxiliary space occupation? More specifically, is the auxiliary space of our function… Read More Space complexity of overwriting function input
Advertisements What is the difference between time complexity of O(n) and O(Log n). Let us say I have a function which has time complexity of O(Log n) and space complexity of n. What will be the time complexity if I have to calculate addition two functions with time complexity of Log n and Log n… Read More calculate time complexity of two functions
Advertisements https://en.wikipedia.org/wiki/Midpoint_circle_algorithm https://www.geeksforgeeks.org/mid-point-circle-drawing-algorithm/ I have been looking into the midpoint circle algorithm and have come across conflicting information on its time complexity. On the Wikipedia page, complexity is not mentioned, but in the GeeksforGeeks article, it is listed as O(x – y). In the above geeksforgeeks article it mentioned Time Complexity: O(x – y) Auxiliary… Read More Time complexity for middlepoint circle algorithm
Advertisements I am learning python slice operations and I decided to write a simple function that iterates through a string with a window of size k and adds the window to the dictionary along with its frequency. So for example if the string input is "abab" and k is 2, the dictionary will contain "ab:2"… Read More What is the time complexity of this python function which includes slice operations?