Link Details

Link 1197455 thumbnail
User 448255 avatar

By dotCore
via bitbucket.org
Submitted: Aug 18 2014 / 16:15

This repo contains an implementation of Dijkstra's smoothsort algorithm. This algorithm is a modification of the Heapsort algorithm which has the special property that insertion of a new maximum element into the heap is O(1) complexity. This feature means that the algorithm can smoothly vary between O(n*lg n) and O(n) complexity depending on how sorted the input array is to begin with.
  • 3
  • 0
  • 52
  • 16

Add your comment


Html tags not supported. Reply is editable for 5 minutes. Use [code lang="java|ruby|sql|css|xml"][/code] to post code snippets.

Voters For This Link (3)



Voters Against This Link (0)



    Apache Hadoop
    Written by: Piotr Krewski
    Featured Refcardz: Top Refcardz:
    1. Play
    2. Akka
    3. Design Patterns
    4. OO JS
    5. Cont. Delivery
    1. Play
    2. Java Performance
    3. Akka
    4. REST
    5. Java