README
¶
go-eng
Overview
This is a personal package I will be using to create various helper packages, as I learn and explore the Go programing language. The main package of this repo is simply to demonstrate the use of a subset of the contained packages.
For full documentation visit the individual packages listed in the directories section pkg.go.dev/github.com/eng618/go-eng#section-directories.
List of Packages
Algorithms
github.com/eng618/go-eng/algo/search- binary search
- loop implementation
- recursion implementation
- linear search
- binary search
github.com/eng618/go-eng/algo/sort- merge sort
Data Structures
github.com/eng618/go-eng/ds/list- linked list
github.com/eng618/go-eng/ds/queue- slice implementation
- linked list implementation
github.com/eng618/go-eng/ds/stack- slice implementation
github.com/eng618/go-eng/ds/hash
Still to come
Planned Algorithms
-
Recursion
-
Sort
- Insertion
- Bubble
- Quick sort
-
Search
- Breadth-first search (BFS)
- Depth-first search (DFS)
Planned Data Structures
- Queue
- Double linked list
- Binary Search Tree (BST)
- Graph
Documentation
¶
Overview ¶
Package Main is simply a demonstration of how to use some of the sub packages within this module. It is not intended to be used by third parties.
For implementation and usage documentation visit the directories section below for all of the subpackages, which contain their own documentation, and examples.
Source Files
Directories
¶
| Path | Synopsis |
|---|---|
|
algo
|
|
|
anagrams
Package anagrams is a package to identify anagrams.
|
Package anagrams is a package to identify anagrams. |
|
fibonacci
Package fibonacci allows you to calculate which fibonacci number would be at a given index.
|
Package fibonacci allows you to calculate which fibonacci number would be at a given index. |
|
search
Package search is a simple package that demonstrates various search algorithms.
|
Package search is a simple package that demonstrates various search algorithms. |
|
sort
Package sort is a collection of sortting algorithms
|
Package sort is a collection of sortting algorithms |
|
vowels
Package vowels has various methods for various operations on manipulating vowels within a strings.
|
Package vowels has various methods for various operations on manipulating vowels within a strings. |
|
ds
|
|
|
hash
Package hash is a basic implementation of the hash data structure.
|
Package hash is a basic implementation of the hash data structure. |
|
list
Package list is used to demonstrates a linked list data structure.
|
Package list is used to demonstrates a linked list data structure. |
|
queue
Package queue is used to demonstrate various implementations of a queue data structure.
|
Package queue is used to demonstrate various implementations of a queue data structure. |
|
stack
Package stack is a simple implementation of the stack data structure.
|
Package stack is a simple implementation of the stack data structure. |
|
std
Package std is used to demonstrate data structures that are defined in the standard library.
|
Package std is used to demonstrate data structures that are defined in the standard library. |
|
examples
|
|
|
contexts
Module
|
|
|
generics
Module
|
|
|
interview
|
|
|
leet
|
|
|
lib
|
|
Click to show internal directories.
Click to hide internal directories.