This contains sample collection of data structures and algorithms in Go language. These are implemented as tutorial lessons. It is work in progress.
- Euclid's Algorithm
- Matrix Manipulations Matrix addition, subtraction, multiplication, transpose operations
Sorting algorithms demonstrated using integer lists, because of no generic support is in golang.
Searching algorithms are basically information retrieval. Basic search problem is locating the record from the storage. In addition this section includes some interesting algorithms to search information for pattern matches like matching subsequence or sequence with maximum value.
- Find Maximum Subarray
- Sorted List - Sequential search with skip
- Sorted List - Binary search
- Find longest common subsequence
Combinatorial algorithms to find the possible combiations in a given set. These can be simple permutaion combintion or combinations with complex rules. Goal of these algorithms to reduce the search space to efficiantly find all combinations.