#codetime

Usually, we don't implement algorithms on our own. We are in the habit of using built in functions for sorting, searching, etc. But what about those evil interview questions about binary search or quick sort algorithms? Why do they ask about those things? 

"To show your understanding of computer science," perhaps you would have said. You are probably right. But it's also probably important to understand these algorithms because it makes you a better programmer. 

I learned a lot of this stuff about 3-4 years ago, it was in my university's program. I didn't have very much practical experience in that time. Maybe you are in the same situation.

Recently, I found a great book about Algorithms and I'd like to share my experience. It's about 1 am, and I'm writing this post while a binary search algorithm I'm playing with is trying to find values (text file contains 10_000_000 ints) that do not exist in the array (1_000_000 ints).

The i7 processor in my MacBook pro is working great. I'm really curious about performance in Java and Erlang.

Ok, here is the code. 

If you need the explanation how it works, Google can explain it much better than I probably can. I just wanted to share this pure C code. If you want to test your CPU, here is the link to the files:

Click

largeW.txt 1_000_000 ints

largeT.txt 10_000_000 ints