2. A theorem states that a sorting algorithm that compares the values being sorted cannot be faster than O(n log n). Why does this result not apply to Radix Sort

This result does not apply to Radix sort because Radix sorting system has a Linear time complexity and not the  complexity of a comparative sorting algorithms. as seen with 0( n log n )

Explanation:

This result does not apply to Radix sort because Radix sorting system has a Linear time complexity and not the  complexity of a comparative sorting algorithms. as seen with 0( n log n )

A Radix sorting algorithm performs its functions of sorting keys by grouping them into place values and there no specific manner it does that i.e. it can be done in an increasing or decreasing manner and its own operation is in ; O( n.k )

pretty sure he is already on ptr which means he will be in the next official patch

explanation:

jeff from overwatch still needs to nerf junkrat, and get rid of the new forced 2x2x2 layout