# CodeStepByStep ## bigoh_algorithms

Language/Type: Python algorithm analysis big-oh

Determine the complexity classes of the algorithms that could be used to perform the following tasks:

 Finding the average of the numbers in a list of integers O(N^2 log N) O(2^N) O(N^N) O(log N) O(N log N) O(N^2) O(1) O(N^3) O(N) (order shuffled) Finding the closest distance between any pair of numbers in an unsorted list (without modifying or copying the list) O(log N) O(N^2 log N) O(N^N) O(N) O(2^N) O(N^2) O(1) O(N log N) O(N^3) (order shuffled) Finding the maximum value in an unsorted list of real numbers O(N) O(1) O(N^N) O(N log N) O(N^3) O(2^N) O(N^2 log N) O(N^2) O(log N) (order shuffled) Counting the median length of the strings in a list O(N^N) O(N^3) O(N) O(N^2 log N) O(N^2) O(log N) O(1) O(2^N) O(N log N) (order shuffled) Counting the number of lines in a file O(2^N) O(N^2 log N) O(N) O(N log N) O(log N) O(1) O(N^3) O(N^N) O(N^2) (order shuffled) Determining whether a given integer representing a year stores a leap year (a year divisible by 4, but not divisible by 100 unless also divisible by 400) O(N^3) O(log N) O(2^N) O(N^2 log N) O(N^N) O(1) O(N) O(N^2) O(N log N) (order shuffled) A sequential search on an unsorted list O(N^3) O(N^2) O(N^N) O(1) O(N log N) O(N) O(log N) O(N^2 log N) O(2^N) (order shuffled) A binary search on a sorted list O(N log N) O(N^N) O(N) O(2^N) O(N^3) O(N^2 log N) O(1) O(log N) O(N^2) (order shuffled)