Blogs / Company blogs

NodeNexus Blog

blog.nodenexus.com

Recently a colleague of mine posed a twist on a basic algorithms question. It’s easy to see that the worst-case performance to check if a random n-length array is sorted is O(n). But what is the average performance? Is it still linear? Sublinear? Is it a function of the length at all? Continue

Popular posts
1
Total points
182
HN comments
49
Rank
#6,542 company

Visit blog.nodenexus.com → RSS feedOn Hacker News Dec 2014 – Dec 2014

Security & Privacy 1Networking & Internet 1

1

A Shark on the Network

DISCLAIMER: I do not condone monitoring network traffic with intent to spy or otherwise cause harm to people. My interest in the techniques described below is academic. I write in the hope that I can improve Internet security, or at least increase public awareness of vulnerabilities. If you are attempting to replicate…