Bruno T. de Abreu

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
A variant of the Ford-Johnson or merge insertion sorting algorithm that we called four Ford-Johnson (4FJ, for short) is presented and proved to execute exactly the same number of comparisons than the Ford-Johnson algorithm. The main advantage of our algorithm is that, instead of recursively working over lists of size the half of the input, as the(More)
  • 1