Skip to content

Go language implementation of selected algorithms from the "Algorithms in a Nutshell" book. The source code attempts to follow, as closely as possible, the algorithm pseudocode from the book. This is an ongoing project

License

Notifications You must be signed in to change notification settings

jpoirier/algorithms

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

15 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Description
------------
Go language implementation of selected algorithms from the 
"Algorithms in a Nutshell" book. The source code attempts to follow,
as closely as possible, the algorithm pseudocode from the book.


Building/Installing/Testing
---------------------------

    $ make [all|clean|install|test|build]

    all   : calls clean, install, and test
    build : compiles but doesn't install


Usage
-----


Examples
--------
    
    Status                                  Completed
    ----------------------------------------------------------
    Sorting Algorithms:                          [X]
        Insertion Sort                      [X]
        Median Sort                         [X]
        Quick Sort                          [X]
        Selection Sort                      [X]
        Heap Sort                           [X]
        Counting Sort                       [X]
        Bucket Sort                         [X]
	
    Searching:                                   []
        Sequential Search                   [X]
        Binary Search                       [X]
        Hash-based Search                   []
        Binary Tree Search                  []
	
    Graph Algorithms:                            []
        Depth-First Search                  []
        Breadth-First Search                []
        Single-Source Shortest Path         []
        All Pairs Shortest Path             []
        Minimum Spanning Tree Algorithms    []
	
    Path Finding in AI:                          []
        Depth-First Search                  []
        Breadth-First Search                []
        A*Search                            []
        Comparison                          []
        Minimax                             []
        NegMax                              []
        AlphaBeta                           []
	
    Network Flow Algorithms:                     []
        Maximum Flow                        []
        Bipartite Matching                  []
        Minimum Cost Flow                   []
        Transshipment                       []
        Transportation                      []
        Linear Programming                  []
	
    Computational Geometry:                      []
        Convex Hull Scan                    []
        LineSweep                           []
        Nearest Neighbor Queries            []
        Range Queries                       []

About

Go language implementation of selected algorithms from the "Algorithms in a Nutshell" book. The source code attempts to follow, as closely as possible, the algorithm pseudocode from the book. This is an ongoing project

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages