docs: improve phrasing for some sorts

Author: 4ndrelim

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

@@ -7,12 +7,12 @@ Though under some conditions (discussed later), the best case could be done in O
 
 ### Implementation Invariant
 
-**At the end of the ith iteration, the ith element
-(of the original array, from either the back or front depending on implementation), is correctly positioned**.
+**At the end of the kth iteration, the smallest (largest) i items are correctly sorted 
+in the first (last) i positions of the array**.
 
 ### Comparison to Selection Sort
 
-Its invariant is quite similar as selection sort's. But they differ slightly in maintaining this invariant.
+Its invariant is quite similar as selection sort's. But they differ in maintaining this invariant.
 The algorithm for cyclic sort does a bit more than selection sort's.
 In the process of trying to find the correct element for the ith position, any element that was
 encountered will be correctly placed in their positions as well.
@@ -29,4 +29,11 @@ We discuss more implementation-specific details and complexity analysis in the r
 2. The [**generalised**](./generalised) case discusses cyclic sort for general inputs. This is comparison-based and is
    usually implemented in O(n^2).
 
+Note that, in practice, the generalised case is hardly used. There are more efficient algorithms to use for sorting,
+e.g. merge and quick sort. If the concern is the number of swaps, generalized cyclic sort does indeed require fewer 
+swaps, but likely won't lower than selection sort's.
+
+In other words, cyclic sort is specially designed for situations where the elements to be sorted are 
+known to fall within a specific, continuous range, such as integers from 1 to n, without any gaps or duplicates.
+
 

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

@@ -34,3 +34,6 @@ time complexity of selectionSort is n + (n-1) + (n-2) + ... + 2 = O(n^2)
 **Space**: O(1) since sorting is done in-place
 
 Image Source: https://www.hackerearth.com/practice/algorithms/sorting/selection-sort/tutorial/
+
+## Notes
+The number of swaps made is always O(n) (careful not to confuse this with the number of comparisons).