Update description selection algorithm.

Author: n3vu0r

src/lib.rs

@@ -1142,8 +1142,9 @@ where
 	///
 	/// # Current Implementation
 	///
-	/// The current algorithm is based on the quickselect portion of the same quicksort algorithm
-	/// used for [`sort_unstable`].
+	/// The current algorithm is an introselect implementation based on Pattern Defeating Quicksort, which is also
+	/// the basis for [`sort_unstable`]. The fallback algorithm is Median of Medians using Tukey's Ninther for
+	/// pivot selection, which guarantees linear runtime for all inputs.
 	///
 	/// [`sort_unstable`]: Slice1Ext::sort_unstable
 	///
@@ -1193,8 +1194,9 @@ where
 	///
 	/// # Current Implementation
 	///
-	/// The current algorithm is based on the quickselect portion of the same quicksort algorithm
-	/// used for [`sort_unstable`].
+	/// The current algorithm is an introselect implementation based on Pattern Defeating Quicksort, which is also
+	/// the basis for [`sort_unstable`]. The fallback algorithm is Median of Medians using Tukey's Ninther for
+	/// pivot selection, which guarantees linear runtime for all inputs.
 	///
 	/// [`sort_unstable`]: Slice1Ext::sort_unstable
 	///
@@ -1245,8 +1247,9 @@ where
 	///
 	/// # Current Implementation
 	///
-	/// The current algorithm is based on the quickselect portion of the same quicksort algorithm
-	/// used for [`sort_unstable`].
+	/// The current algorithm is an introselect implementation based on Pattern Defeating Quicksort, which is also
+	/// the basis for [`sort_unstable`]. The fallback algorithm is Median of Medians using Tukey's Ninther for
+	/// pivot selection, which guarantees linear runtime for all inputs.
 	///
 	/// [`sort_unstable`]: Slice1Ext::sort_unstable
 	///