If someone wrote a linear search on something that could be done with a binary search, that may perform a lot of unneded cycles (or it may not due cache misses in the binary search case). I don't think this is possible to quantify, you would need experts go through the orignal code to find optimization opportinities , and even then there would be an infinite number ways to achieve the same result or write the same program, many which could be more efficient