Skip to content

galaux/algo

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

5 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Some algorithms implementation just for fun

Except for the Quick sort, all algorithms should be coded in Scala.

  • s01: Simple Divide and Conquer
  • s02: Quick sort (implemented in Go to try out Go)
  • s03: Random Contraction

About the go implementation of the Quick Sort

Use the following one liner to 'continuously' build and run the app (thanks [0]): inotifywait -m -r -e close_write --exclude '.*\.sw[a-z]' src/ | while read line; do make; done

[0] http://notes.kel.pe/post/14062831170/continuous-compilation

About

No description, website, or topics provided.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published