docs: updated readme to talk about number systems

Author: yeoshuheng

src/main/java/algorithms/sorting/radixSort/README.md

@@ -17,24 +17,29 @@ This takes advantage of the concept of place value.
 
 ## Complexity Analysis
 **Time**:
-Note that we will always need to iterate through 10 different queues to rebuild our original array,
-and we iterate through all *w* positions, this results in:
+Let *k* be the base of the number system being used. For integers in java, it is base 10 
+(we have digits 0 to 9), in the case of base 2 (binary), we only have 2 digits (1, 0),
+base 3, (0, 1, 2). Hence, we can see that the base of the number system determines the number of 
+different queues we need to iterate through to rebuild our original array, additionally, we also 
+need to iterate through all *w* positions (digits), this results in the following complexities:
 
-- Worst case: O(w * (n + 10))
-- Average case: O(w * (n + 10))
-- Best case (sorted array): O(w * (n + 10))
+- Worst case: O(w * (n + k))
+- Average case: O(w * (n + k))
+- Best case (sorted array): O(w * (n + k))
 
-**Space**: O(n + 10) 
+**Space**: O(n + k) 
 
 ## Notes
 - Radix sort's time complexity is dependent on the maximum number of digits in each element,
 hence it is ideal to use it on integers with a large range and with little digits.
 - This could mean that Radix Sort might end up performing worst on small sets of data 
 if any one given element has a in-proportionate amount of digits.
-- Counting sort is used as a sub-routine within the Radix Sort process.
+- It is interesting to note that counting sort is used as a sub-routine within the 
+Radix Sort process.
 
 ### Common Misconception
 - While not immediately obvious, we can see that radix sort is a stable sorting algorithm as
-  they are enqueued in a manner where the first observed element will be at the head of the queue.
+  they are enqueued in a manner where the first observed element remains at the head of the queue.
 - While it is non-comparison based, not that total ordering of elements is still required -
-  except now this property is forced upon the algorithm in the manner of the queues.
+  except now this property is forced upon the algorithm in the manner of how the queues 
+are structured.