示例程序的大值(Big o value of sample program)

 我正在尝试编程逻辑的最坏情况，需要一些澄清。 
 
 这是一个非常简单的程序，需要一个数字 - 2938023，每个字符乘以一个随机数并填入一个列表中。 
 
 填充列表后，我得到最大值作为结果。 
 
from random import randint
def test(A):
    result = []
    for each in str(A):
        result.append(int(each)*randint(0,9))   
    return max(result)


print test(2938023)     
 
 这次行动的最大案例是什么？ 由于list-str（A）只迭代一次，我应该将其视为log（n）或 
 
 我应该将其视为n * n，因为再次迭代列表以获得最大值。 基于n的列表中有2个传递。 

Im trying to big o worst case scenario for a programming logic and need some clarification.
 
Here is a very simple program, it takes a number - 2938023 and each char is multiplied by a random number and populated in a list.
 
Once the list is populated, I get the max value as my result. 
 
from random import randint
def test(A):
    result = []
    for each in str(A):
        result.append(int(each)*randint(0,9))   
    return max(result)


print test(2938023)     
 
What is the big o worst case of this operation? As the list - str(A) is iterated only once, should I consider it to be log(n) or
 
Should I consider it n*n as the list is again iterated to get the max value. There is 2 pass on the list based on n.

原文：https://stackoverflow.com/questions/43928667