Runtime of dynamic programming versus it's naive recursive counterpart Question: The problem follows: You are playing a game where you start with n sticks in a pile (where n is a positive integer), and each turn you can take away exactly 1, 7, or 9 sticks from the pile (if there are fewer than 9 …
Time complexity of recursion of multiplication Question: What is the worst case time complexity (Big O notation) of the following function for positive integers? def rec_mul(a:int, b:int) -> int: if b == 1: return a if a == 1: return b else: return a + rec_mul(a, b-1) I think it’s O(n) but my friend claims …
Big O notation : limited input Question: As an exercise, I am trying to set Monte Carlo Simulation on a chosen ticker symbol. from numpy.random import randint from datetime import date from datetime import timedelta import pandas as pd import yfinance as yf from math import log # ticker symbol ticker_input = "AAPL" # change …
Triple nested while loop – Big Oh Notation – Count of Primitive Operations Question: I’m having some trouble figuring out the primitive count of operations for the following lines of code def question1(n): n = n # 1 ops i = 0 # 1 ops a = 0 # 1 ops while i < n: …
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 …
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 …
Is O((b-a)/c) the time complexity of list[a:b:c] in python3? Question: According to https://wiki.python.org/moin/TimeComplexity, the complexity of "Get a Slice" from list is O(k) and k is the length of wanted slice. If there is a step parameter, the complexity will become O(k/step)? (i.e. O((b-a)/c) for list[a:b:c]) Asked By: shenlebantongying || Source Answers: Surely it is. …
Time complexity of finding range of target in sorted array – Is this solution O(N) in the worst case? Question: I was going through LeetCode problem 34. Find First and Last Position of Element in Sorted Array, which says: Given an array of integers nums sorted in non-decreasing order, find the starting and ending position …
What is the efficiency of python's list slicing? Question: I am wondering what is the efficiency of slicing lists in python? For Example: myList = [1, 2, 3, 4, 5] newList = myList[1:4] I’m looking for big-O notation (e.g. O(n)). Asked By: Wahid Bawa || Source Answers: It’s O(n) for lists, and most sequence types, …
