Complexity analysis and performance of double hashing sort algorithm
Abstract Sorting an array of n elements represents one of the leading problems in different fields of computer science such as databases, graphs, computational geometry, and bioinformatics. A large number of sorting algorithms have been proposed based on different strategies. Recently, a sequential...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
SpringerOpen
2019-04-01
|
| Series: | Journal of the Egyptian Mathematical Society |
| Subjects: | |
| Online Access: | http://link.springer.com/article/10.1186/s42787-019-0004-2 |