From 949aa0ec051b4ae5a39940d8cef8bdd232f03ca6 Mon Sep 17 00:00:00 2001 From: Mattias Andrée Date: Tue, 21 Jan 2014 17:37:45 +0100 Subject: m doc MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit Signed-off-by: Mattias Andrée --- src/algorithms/searching/MultibinarySearch.java | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) (limited to 'src') 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 -- cgit v1.2.3-70-g09d2