performance - Fastest pair class in Java -
i'm writing external sort in java, using n-way merge algorithm this question. involves adding , polling pairs of integers , java.util.priorityqueue
. currently, i'm using abstractmap.simpleimmutableentry
pairs, that's slower previous non-priority-queue approach (even though it's asymptotically faster)! there faster pair class available, or should write own? need pairs of integers can sorted first one, apart thing matters speed. clarify, code isn't unreasonably slow (it's not surprising priority queue approach isn't faster, given while asymptotic complexity goes o(mn) o(m log n), n quite small), feel making fast possible.
wiki
Comments
Post a Comment