https://github.com/risto-stevcev/haskell-mergesort

Mergesort implementation in Haskell
https://github.com/risto-stevcev/haskell-mergesort

algorithm haskell mergesort

Last synced: 8 days ago
JSON representation

Mergesort implementation in Haskell

• Host: GitHub
• URL: https://github.com/risto-stevcev/haskell-mergesort
• Owner: Risto-Stevcev
• Created: 2014-05-08T10:48:34.000Z (over 10 years ago)
• Default Branch: master
• Last Pushed: 2014-05-08T10:55:28.000Z (over 10 years ago)
• Last Synced: 2023-04-10T20:11:29.961Z (over 1 year ago)
• Topics: algorithm, haskell, mergesort
• Language: Haskell
• Size: 383 KB
• Stars: 0
• Watchers: 1
• Forks: 1
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
Haskell MergeSort

=================

The focus of my implementation was to make it as simple and as readable as possible. Surprisingly, it has similar 

performance characteristics compared to the mergesort implementation from 

[GHC](http://hackage.haskell.org/package/base-4.7.0.0/docs/src/Data-List.html#sort). The *version2* folder contains the

GHC implementation, and running on the IntArray.txt list of 100,000 integers shows similar results (*~0.75ms*). The 

GHC version does seem slightly faster.