# Random Wits

Life is too short for a diary

\$ random wits
├── tags

├── bookshelf

├── resources

├── quotes

├── habits

Any deterministic general sorting algorithm has average case time complexity $\Omega(n\log{}n)$ . However, certain sorting algorithm can run faster in $O(n)$ but with limitation. Instead of comparision-based sort, each element is looked individually by its value. Radix sort is one fine example of integer sorting.