what is n in big o?
When analyzing the Big-O performance of sorting algorithms, n typically represents the number of elements that you're sorting. ... This is why Bubble Sort is considered to be an extremely poor sorting algorithm, because it doesn't scale well with increasing numbers of elements to sort.