go-ds icon indicating copy to clipboard operation
go-ds copied to clipboard

Published 20 hours ago • verified publisher icon ektagarg

Add algorithms

Open ektagarg opened this issue 6 years ago • 5 comments

Implement any algorithm:

  1. Huffman coding algorithm
  2. Dijkstra's algorithm
  3. Prim's algorithm [DONE]
  4. Kruskal's algorithm [DONE]
  5. Tim sort [DONE]
  6. Cocktail sort [DONE]
  7. Cycle sort [DONE]
  8. Bitonic sort [DONE]

Rules

  1. Add yourprogram.go file to the respective folder for example sort will go to Array/sort/yoursort
  2. Add yourprogram_test.go file and write all possible test cases
  3. Add Readme.md

ektagarg avatar Oct 21 '19 21:10 ektagarg

Sounds great ill try some of those!

AngelsProjects avatar Oct 22 '19 04:10 AngelsProjects

Was thinking about implementing a trie or maybe an ADT (Abstract Data Type) for graphs, in order to make coding Prim or Kruskal easier (wouldn't need to reimplement the ADT every time.

Let me know if any of those interest you :)

gmelodie avatar Oct 22 '19 17:10 gmelodie

@gmelodie sounds good, go ahead!

ektagarg avatar Oct 22 '19 18:10 ektagarg

Have already added, cocktail implementation. Please check @ektagarg

dianashevchenko avatar Oct 24 '19 18:10 dianashevchenko

Added Dijkstra shortest path, Please check @ektagarg

dianashevchenko avatar Oct 27 '19 09:10 dianashevchenko