query: Java: Linear Search Algorithm
positive_passages.docid: 126
positive_passages.text: How do I compare strings in Java?
negative_passages.docid: 155605
negative_passages.text: Find combinations in arrays
negative_passages.docid: 43175
negative_passages.text: Is there an O(n) integer sorting algorithm?
negative_passages.docid: 117025
negative_passages.text: Selection algorithms on sorted matrix
negative_passages.docid: 123009
negative_passages.text: How to implement searching of a string in an array of dictionaries?
negative_passages.docid: 157659
negative_passages.text: Optimal Quicksort for Single Linked List
negative_passages.docid: 109264
negative_passages.text: Algorithm to separate items of the same type
negative_passages.docid: 54937
negative_passages.text: How do I search for a number in a 2d array sorted left to right and top to bottom?
negative_passages.docid: 153441
negative_passages.text: Help me please to choose proper path-finding algorithm
negative_passages.docid: 10524
negative_passages.text: Find the number in an array that is closest to a given number
negative_passages.docid: 105873
negative_passages.text: Construct an algorithm to find the multiple of A such that A%B is maximized
negative_passages.docid: 29149
negative_passages.text: Grid search vs. random search for hyperparameter tuning
negative_passages.docid: 128627
negative_passages.text: Algorithm to find next greater permutation of a given string
negative_passages.docid: 3822
negative_passages.text: finding closest value in an array
negative_passages.docid: 5772
negative_passages.text: Graphically solving a linear programming problem
negative_passages.docid: 147822
negative_passages.text: Get the second largest number in a list in linear time
negative_passages.docid: 98361
negative_passages.text: Efficiently searching geolocations - LAT/LNG and DECIMALs