Corpus ID: 201316402

Engineering Faster Sorters for Small Sets of Items

@article{Marianczuk2019EngineeringFS,
  title={Engineering Faster Sorters for Small Sets of Items},
  author={Jasper Marianczuk},
  journal={ArXiv},
  year={2019},
  volume={abs/1908.08111}
}
  • Jasper Marianczuk
  • Published in ArXiv 2019
  • Computer Science, Mathematics
  • Sorting a set of items is a task that can be useful by itself or as a building block for more complex operations. The more sophisticated and fast sorting algorithms become asymptotically, the less efficient they are for small sets of items due to large constant factor. This thesis aims to determine if there is a faster way to sort base case sizes than using insertion sort. For that we looked at sorting networks and how to implement them efficiently. Because sorting networks need to be… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    Citations

    Publications citing this paper.

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 28 REFERENCES

    Sorting network generator. http://pages.ripco.net/~jgamble/nw.html, Website accessed 2019

    • JM Gamble
    • 2019

    https://github.com/bertdobbelaere/SorterHunter, Website accessed 2019

    • Dobbelaere B. SorterHunter
    • 2017

    Optimal Sorting Networks. In: 8th International Conference on Language and Automata Theory and Applications (LATA)

    • D Bundala, J. Zavodny
    • 2014

    Twenty-Five Comparators Is Optimal When Sorting Nine Inputs (and Twenty-Nine for Ten)