Given the following code fragment, what is its Big-O running time and why?
1.    Given the following code fragment, what is its Big-O running time and why?
# Create a function that
deflogarithmic(n):
   operations = []
# While n is longer than 1, repeat this:
whilelen(n)Â >1:
# Find half the lengh of n
       half_length =int(len(n)/2)
# Add half the values of n to operations
       operations = operations + n[0:half_length]
# make n half the length of itself, then restart the loop
       n = n[0:half_length]
# Return the number of operations
return'Number of operations: '+str(len(operations))
Answers
Status NEW
Posted 04 Nov 2017 07:11 AM
My Price 8.00
----------- Â ----------- H-----------ell-----------o S-----------ir/-----------Mad-----------am ----------- Th-----------ank----------- yo-----------u f-----------or -----------you-----------r i-----------nte-----------res-----------t a-----------nd -----------buy-----------ing----------- my----------- po-----------ste-----------d s-----------olu-----------tio-----------n. -----------Ple-----------ase----------- pi-----------ng -----------me -----------on -----------cha-----------t I----------- am----------- on-----------lin-----------e o-----------r i-----------nbo-----------x m-----------e a----------- me-----------ssa-----------ge -----------I w-----------ill----------- be----------- qu-----------ick-----------ly
Not Rated(0)