Added references to the Power Sort algorithm in power_sort.py, including links to the Wikipedia page and the original paper by Munro and Wild.

Author: a3ro-dev

sorts/power_sort.py

@@ -14,6 +14,10 @@
 Time Complexity: O(n log n) worst case, O(n) for nearly sorted data
 Space Complexity: O(n) for merge buffer
 
+References:
+- https://en.wikipedia.org/wiki/Powersort
+- https://arxiv.org/abs/1805.04154 (Original paper by Munro and Wild)
+
 For doctests run:
 python -m doctest -v power_sort.py