[A-7068] Unix Sorting and Breaking n*log(n)

View previous topic View next topic Go down

[A-7068] Unix Sorting and Breaking n*log(n)

Post  Oncle Jean on Mon Nov 12, 2012 4:04 am

Spencer Carroll

I recently built a small suite of programs that sorts words in a file in theoretically less than n*log(n) time and outputs only unique words.

http://spencer-carroll.com/?p=155

_________________
Oncle Jean

- Newsletter
http://tech.groups.yahoo.com/group/slack_linux_fans/

Oncle Jean
Admin

Posts: 8332
Join date: 2009-10-24
Age: 53
Location: Québec

http://slacklinux.darkbb.com

Back to top Go down

View previous topic View next topic Back to top

- Similar topics

Permissions in this forum:
You cannot reply to topics in this forum