Big-O of list slicing

by

Getting a slice is O(i_2 - i_1). This is because Python’s internal representation of a list is an array, so you can start at i_1 and iterate to i_2.

For more information, see the Python Time Complexity wiki entry

You can also look at the implementation in the CPython source if you want to.

More Related Contents:

  1. Complexity of list.index(x) in Python
  2. How do i search for 2 of the same numbers in a list? (python) [closed]
  3. Accessing the index in ‘for’ loops
  4. Finding the index of an item in a list
  5. What is the difference between Python’s list methods append and extend?
  6. How to remove an element from a list by index
  7. Get a list of numbers as input from the user
  8. How can I compare two lists in python and return matches
  9. TypeError: ‘list’ object is not callable in python
  10. Difference between del, remove, and pop on lists
  11. Create nice column output in python
  12. Comparing two lists using the greater than or less than operator
  13. Python: Finding differences between elements of a list
  14. How to get first element in a list of tuples?
  15. Append to a list defined in a tuple – is it a bug? [duplicate]
  16. Unsupported operand type(s) for +: ‘int’ and ‘str’ [duplicate]
  17. String to list in Python
  18. Removing a list of characters in string
  19. How to get last items of a list in Python?
  20. Generate a list of datetimes between an interval
  21. Finding first and last index of some value in a list in Python
  22. Appending a dictionary to a list in a loop
  23. Generating all possible combinations of a list, “itertools.combinations” misses some results
  24. python assign values to list elements in loop
  25. One liner: creating a dictionary from list with indices as keys
  26. Splitting List That Contains Strings and Integers
  27. Efficient method to calculate the rank vector of a list in Python
  28. Print a list in reverse order with range()?
  29. How do I reverse a list using recursion in Python?
  30. Find a value in a list [duplicate]

Leave a Comment