###### Android

## We have seen in the class lectures that the smallest big-O estimate for a comparison-type sort algorithm is O(n log n)…..

Question: 1 We have seen in the class lectures that the smallest big-O estimate for a comparison-type sort algorithm is O(n log n). Are there any more computationally efficient algorithm!? Consider a vector of votes (V) for an array of integer numbers (a). Each element in V declares the number Read more…