The library implementing some basic algorithms and data structures.

• algorithms:
  • search:
    • search for the minimal item in a slice
    • search for the maximal item in a slice
    • linear search
    • binary search
  • filtering out the non-unique items in a slice:
    • universal
    • in a sorted slice only
    • via a set (a data structure); i.e., in a slice containing hashable items only
  • merging two sorted slices
  • sorting:
    • bubble sort
    • cocktail sort
    • comb sort
    • insertion sort
    • Shell sort
    • selection sort
    • merge sort
    • quicksort
• data structures:
  • set:
    • operations:
      • checking that a set contains an item
      • adding an item
      • removing an item
      • evaluating union with another set
      • evaluating intersection with another set
      • evaluating difference between two sets
  • multiset:
    • operations:
      • checking that a set contains an item
      • adding an item
      • removing an item
      • evaluating sum with another set
      • evaluating union with another set
      • evaluating intersection with another set
      • evaluating difference between two sets

$ go get github.com/irenicaa/go-algorithms

The MIT License (MIT)

Copyright © 2022 irenica