NEW
Font size
Worksheets2_資料結構-時間複雜度
Total questions: 8
Worksheet time: 5mins
Time Complexity時間複雜度O(n)、O(n2)、O(lgn)、O(2n), 哪一個最有效率？(Which time complexity is the fastest?)
O(n)
O(n2)
O(lgn)
O(2n)
Time Complexity時間複雜度O(n)、O(n2)、O(lgn)、O(2n), 哪一個最沒有效率？(Which time complexity is the slowest?)
O(n)
O(n2)
O(lgn)
O(2n)
Time Complexity時間複雜度O(n)、O(1)、O(lgn)、O(n!)，哪一個最有效率？(Which time complexity is the fastest?)
O(n)
O(1)
O(lgn)
O(n!)
Time Complexity時間複雜度O(n)、O(1)、O(lgn)、O(n!)，哪一個最沒有效率？(Which time complexity is the slowest?)
O(n)
O(1)
O(lgn)
O(n!)
試問數學式或多項式2n+n3+n+1的Big-O為何?(What is the Big-O notation of 2n+n3+n+1?)
O(2n)
O(n3)
O(n)
O(1)
試問數學式或多項式n3+810n2的Big-O為何?(What is the Big-O notation of n3+810n2)
O(n3)
O(810)
O(n2)
O(1)
試問下列數學式或多項式Big-O為何?(What is the Big-O notation ?)
O(n)
O(k)
O(n2)
O(1)
試問下列數學式或多項式Big-O為何?(What is the Big-O notation ?)
O(n)
O(k)
O(n2)
O(1)
