Okay, so what is happening here puzzled me for 2 days. Basically, as an activity I was measuring how much time some algorthim takes to execute in its worse, average, and best cases. Until now, I got expected results for all the ones I tested, except for the binary search: Linear search time was increasing linearly, bubble sort was increasing following N^2, etc. Also the average values were as expected, so in linear search it was almost half of the worse case, etc.