https://github.com/jeongoon/combinations-bench

https://github.com/jeongoon/combinations-bench

Last synced: 17 days ago
JSON representation

• Host: GitHub
• URL: https://github.com/jeongoon/combinations-bench
• Owner: jeongoon
• License: osl-3.0
• Created: 2022-04-01T11:15:06.000Z (almost 3 years ago)
• Default Branch: main
• Last Pushed: 2022-04-15T23:22:54.000Z (over 2 years ago)
• Last Synced: 2024-11-05T11:16:22.354Z (2 months ago)
• Language: Haskell
• Size: 158 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.org
  • License: LICENSE

Awesome Lists containing this project

README

        
* Just For Fun Benchmark for combinations

I like combiantions. and I found my module competitive with others.

At the same time I'd like to improve my code as well.

And I always had weakness on testing code. I'm going to study about it.

** Language Available

*** HACKING Golang

    I am trying to code in many language but

    `golang` is super fast for any imperative implementation.

    * [X] /no-crossed-fingers/ method (my own method)

    * [ ] recursive method

      - after haskell resursive version

    * [ ]bench mark by using *go test* [1/3]

      * [ ] put the module into separate file and load from `_test.go`

      * [ ] no-crossed-finger(jeongoon: me)

      * [X] https://github.com/notnil/combos

*** TODO Haskell [0/2]

    - [ ] follwers & leaders version (my first try)

    - [ ] tail after tail version (my second try)

     * How to benchmark??

 

*** TODO Perl

    Coming soon. This is my original vesion of /no-crossed-fingers/ method

    

* Recursive Combinations cannot beat the Imperative Combinations?

Still I have no idea, however imperative my implentation tends to

win the race over recursive one.