Radix Sort with a mix of positive and negative integers without added time complexity.

#radix_sort

One of the beautiful things about Radix Sort is that of the basic sorting algorithms it sits on the low end of Big O. Generally speaking, its time complexity in both the best and worst case scenarios is O(nk), where n is the size of the array and k is the amount of digits in the array’s largest integer. It keeps the time complexity low because…