aboutsummaryrefslogtreecommitdiffstats
diff options
context:
space:
mode:
authorMattias Andrée <maandree@operamail.com>2014-01-21 17:37:45 +0100
committerMattias Andrée <maandree@operamail.com>2014-01-21 17:37:45 +0100
commit949aa0ec051b4ae5a39940d8cef8bdd232f03ca6 (patch)
treea7401569ab84264728811a766127b64adb9632f2
parentsort order support in multibinary search (diff)
downloadalgorithms-and-data-structures-949aa0ec051b4ae5a39940d8cef8bdd232f03ca6.tar.gz
algorithms-and-data-structures-949aa0ec051b4ae5a39940d8cef8bdd232f03ca6.tar.bz2
algorithms-and-data-structures-949aa0ec051b4ae5a39940d8cef8bdd232f03ca6.tar.xz
m doc
Signed-off-by: Mattias Andrée <maandree@operamail.com>
-rw-r--r--src/algorithms/searching/MultibinarySearch.java4
1 files changed, 2 insertions, 2 deletions
diff --git a/src/algorithms/searching/MultibinarySearch.java b/src/algorithms/searching/MultibinarySearch.java
index 663de7c..c1bf400 100644
--- a/src/algorithms/searching/MultibinarySearch.java
+++ b/src/algorithms/searching/MultibinarySearch.java
@@ -89,7 +89,7 @@ public class MultibinarySearch
* of elements is named ‘m’ in the complexity analysis
* @param array Sorted list in which to search, the number of elements
* is named ‘n’ in the complexity analysis
- * @param order The lists' element order
+ * @param order The lists' (both) element order
* @param mode The search mode
* @return Two arrays of integer arrays, the 0:th being the indices
* of items, the 1:th being their positions. That is,
@@ -112,7 +112,7 @@ public class MultibinarySearch
* of elements is named ‘m’ in the complexity analysis
* @param array Sorted list in which to search, the number of elements
* is named ‘n’ in the complexity analysis
- * @param order The lists' element order
+ * @param order The lists' (both) element order
* @param mode The search mode
* @param start The index of the first position to search in the array
* @return Two arrays of integer arrays, the 0:th being the indices