Skip to content

Commit 6bbc9ab

Browse files
jourdanrodriguesjourdanrodrigues
authored
Add links to completed algorithms
Closes #94.
1 parent 11d1a9b commit 6bbc9ab

1 file changed

Lines changed: 14 additions & 14 deletions

File tree

‎README.md‎

Lines changed: 14 additions & 14 deletions
Original file line numberDiff line numberDiff line change
@@ -57,11 +57,11 @@ Tarjan's off-line least common
5757

5858
* Euclidean shortest path problem : find the shortest path between two points that does not intersect any obstacle
5959

60-
* Longest path problem : find a simple path of maximum length in a given graph
60+
* [Longest path problem](LongestPath) : find a simple path of maximum length in a given graph
6161

6262
* Bellman–Ford algorithm : computes shortest paths in a weighted graph (where some of the edge weights may be negative)
6363

64-
* Dijkstra's algorithm : computes shortest paths in a graph with non-negative edge weights
64+
* [Dijkstra's algorithm](Dijkstra's%20) : computes shortest paths in a graph with non-negative edge weights
6565

6666
* Floyd–Warshall algorithm : solves the all pairs shortest path problem in a weighted, directed graph
6767

@@ -84,7 +84,7 @@ Tarjan's off-line least common
8484
* Bidirectional search : find the shortest path from an initial vertex to a goal vertex in a directed graph
8585

8686
* Bloom filter : a constant time and memory check to see whether a given element exists in a set. May return a false positive, but never a false negative.
87-
* Breadth-first search : traverses a graph level by level
87+
* [Breadth-first search](BreadthFirstSearch) : traverses a graph level by level
8888

8989
* Brute-force search : An exhaustive and reliable search method, but computationally inefficient in many applications.
9090
* D : an incremental heuristic search algorithm
@@ -125,14 +125,14 @@ Jaro–Winkler distance : is a measure of similarity between two strings
125125

126126
* Trigram search : search for text when the exact syntax or spelling of the target object is not precisely known
127127

128-
* Linear search : finds an item in an unsorted sequence
128+
* [Linear search](LinearSearch) : finds an item in an unsorted sequence
129129
Selection algorithm : finds the <i>k</i>th largest item in a sequence
130130

131-
* Ternary search : a technique for finding the minimum or maximum of a function that is either strictly increasing and then strictly decreasing or vice versa
131+
* [Ternary search](TernarySearch) : a technique for finding the minimum or maximum of a function that is either strictly increasing and then strictly decreasing or vice versa
132132

133-
* Binary search algorithm : locates an item in a sorted sequence
133+
* [Binary search algorithm](BinarySearch) : locates an item in a sorted sequence
134134

135-
* Fibonacci search technique : search a sorted sequence using a divide and conquer algorithm that narrows down possible locations with the aid of Fibonacci numbers
135+
* [Fibonacci search technique](Fibonacci) : search a sorted sequence using a divide and conquer algorithm that narrows down possible locations with the aid of Fibonacci numbers
136136

137137
* Predictive search : binary-like search which factors in magnitude of search term versus the high and low values in the search. Sometimes called dictionary search or interpolated search.
138138

@@ -150,33 +150,33 @@ Selection algorithm : finds the <i>k</i>th largest item in a sequence
150150

151151
* Smith–Waterman algorithm : find local sequence alignment
152152

153-
* Bubble sort : for each pair of indices, swap the items if out of order
153+
* [Bubble sort](BubbleSort) : for each pair of indices, swap the items if out of order
154154

155-
* Quicksort : divide list into two, with all items on the first list coming before all items on the second list.; then sort the two lists. Often the method of choice
155+
* [Quicksort](QuickSort) : divide list into two, with all items on the first list coming before all items on the second list.; then sort the two lists. Often the method of choice
156156

157157
* Introsort : begin with quicksort and switch to heapsort when the recursion depth exceeds a certain level
158158

159159
* Timsort : adaptative algorithm derived from merge sort and insertion sort. Used in Python 2.3 and up, and Java SE 7.
160160

161-
* Insertion sort : determine where the current item belongs in the list of sorted ones, and insert it there
161+
* [Insertion sort](InsertionSort) : determine where the current item belongs in the list of sorted ones, and insert it there
162162

163163
* Shell sort : an attempt to improve insertion sort
164164

165165
* Cycle sort : in-place with theoretically optimal number of writes
166166

167-
* Merge sort : sort the first and second half of the list separately, then merge the sorted lists
167+
* [Merge sort](MergeSort) : sort the first and second half of the list separately, then merge the sorted lists
168168

169169
* Burstsort : build a compact, cache efficient burst trie and then traverse it to create sorted output
170170

171171
* Postman sort : variant of Bucket sort which takes advantage of hierarchical structure
172172

173173
* Radix sort : sorts strings letter by letter
174174

175-
* Heapsort : convert the list into a heap, keep removing the largest element from the heap and adding it to the end of the list
175+
* [Heapsort](HeapSort) : convert the list into a heap, keep removing the largest element from the heap and adding it to the end of the list
176176

177-
* Selection sort : pick the smallest of the remaining elements, add it to the end of the sorted list
177+
* [Selection sort](SelectionSort) : pick the smallest of the remaining elements, add it to the end of the sorted list
178178

179-
* Kadane's algorithm : finds maximum sub-array of any size
179+
* [Kadane's algorithm](Kadane's) : finds maximum sub-array of any size
180180

181181
* Longest common subsequence problem : Find the longest subsequence common to all sequences in a set of sequences
182182

0 commit comments

Comments
 (0)