What is the time complexity of a bubble sort algorithm applied n times to the same array? Question: I had this question on a test and i’m trying to understand it: What is the time complexity of this function (in the worst case) assuming that Bubblesort() is the most optimized version of the Bubble Sort …
What is the Time Complexity (Big-O) of a .replace() within a while loop? Question: I was debating an optimal approach with my peer to an algorithms question about how to count the unpaired parenthesis in a string. Here’s an excerpt for the problem description: A string of brackets is considered correctly matched if every opening …
Python string comparisons time complexity Question: I’m curious how Python performs string comparisons under the hood. For example if if s1 == s2: print(True) else: print(False) is the same as condition= True for x,y in zip(s1, s2): if x != y: condition = False print(condition) Perhaps under the hood python is able to use ord …
time & space complexity of list versus array operations Question: I’m trying to wrap my head around the space & time complexity of algorithms. I have two examples of different ways to modify each individual element in an array. I’m using Python and I’m curious if there’s a difference between the complexity of these two …
How are lists converted into sets in Python 3? And what's the performance/complexity of this conversion? Question: Maybe I missed something, but I couldn’t find an answer to this on SO or the Python docs. Got curious about what actually happens under the hood when we write the following code: maybe_smaller_set = set(some_huge_list) Since sets …
Is it faster to create a new python array and initialize it to 0, or to create a copy of an array? Question: I am confused about how much time it takes python to initialize a new array in Python. Let’s say I wanted to create an array of length n and eventually populate it …
Expected execution time vs actual execution time in python Question: I have two different functions for solving the knapsack problem. The difference in these functions is that the v2 function uses less space over v1. From my time complexity analysis, the v2 function should not be faster than v1. However, after running my test cases …
Big O time complexity for nested for loop (3 loop) Question: def unordered pair(arrayA, arrayB): for i in range(len(arrayA)): for j in range(len(arrayB)): for k in range(0, 100000): print(arrayA[i] + arrayB[j]) I just started Big O and need help on this example. If I tried to get the time complexity for each line, I know …
What is the time complexity of a while loop that uses random.shuffle (python) inside of it? Question: first of all, can we even measure it since we don’t know how many times random.shuffle will shuffle the array until it reaches the desired outcome def sort(numbers): import random while not sort(numbers)==numbers: random.shuffle(numbers) return numbers Asked By: …
Find the minimum number of steps to half the sum of elements in a list where each step halves an item in the list in O(N) Question: I came across an interview question that went like this: There are factories in an area which produce a pollutive gas and filters are to be installed at …
