O(max(input)+n)
The complexity just appears awkward to express because most sorting algorithms are data agnostic. Their time scales with the amount of data, not the data itself.
FWIW, as pointed out here, this is not a reliable algorithm for sorting data.
More Related Contents:
- How to solve T(n)=4T(sqrt(n/2))+n^(3/2)
- Computational complexity of Fibonacci Sequence
- What is O(log(n!)) and O(n!) and Stirling Approximation
- What is O(log(n!)), O(n!), and Stirling’s approximation?
- Finding Big O of the Harmonic Series
- What does O(log n) mean exactly?
- What is the difference between Θ(n) and O(n)?
- Javascript ES6 computational/time complexity of collections
- Time complexity of Euclid’s Algorithm
- Given n points on a 2D plane, find the maximum number of points that lie on the same straight line
- What is pseudopolynomial time? How does it differ from polynomial time?
- Time complexity of Java’s substring()
- What would cause an algorithm to have O(log n) complexity?
- Is there anything that guarantees constant time for accessing a property of an object in JavaScript?
- Sorting in linear time? [closed]
- If strings are immutable in .NET, then why does Substring take O(n) time?
- Time complexity of a recursive algorithm
- What sorting algorithm does Swift implement for its standard library?
- Why is the time complexity of both DFS and BFS O( V + E )
- O(klogk) time algorithm to find kth smallest element from a binary heap
- Big O of JavaScript arrays
- Maximum single-sell profit
- Why do we ignore co-efficients in Big O notation?
- Non-Trivial Lazy Evaluation
- What is the time complexity of heapq.nlargest?
- Time complexity of JavaScript’s array.length
- Runtime of python’s if substring in string
- Count number of digits – which method is most efficient?
- Do iterative and recursive versions of an algorithm have the same time complexity?
- Time complexity of System.arraycopy(…)?