An array A[1..n] contains n− n logn positive integer numbers that are smaller than nf for some unknown constant f. Remaining n/logn numbers in A can be arbitrarily large. Describe an algorithm that sorts the array A in worst-case O(n) time.

Css3 is the latest evolution of the cascading style sheets language and aims at extending css2.1. it brings a lot of new features and additions, like rounded corners, shadows, gradients, transitions or animations, as well as new layouts like multi-columns, flexible box or grid layouts.credits to medium for making this answer credits to google for copying this answercredits to me for putting this answer on your question

I’m not sure but i need to know too