Crossmark

Complexity analysis and performance of double hashing sort algorithm

Crossref DOI link: https://doi.org/10.1186/s42787-019-0004-2

Published Online: 2019-04-04

Published Print: 2019-12

Update policy: https://doi.org/10.1007/springer_crossmark_policy

Authors

Bahig, Hazem M. https://orcid.org/0000-0001-9448-6168
License Information

Text and Data Mining valid from 2019-04-04
More Information

Article History

Received: 1 November 2018

Accepted: 16 December 2018

First Online: 4 April 2019

Authors’ information

: Hazem Bahig received the B.Sc. degree in Pure Mathematics and Computer Science from Ain Shams University, Faculty of Science in 1990. He also received M.Sc. and Ph. D. degrees in Computer Science in 1997 and 2003 respectively from Computer Science Division, Ain Sham University, Cairo, Egypt. Also, he is currently working in the College of Computer Science and Engineering, Hail University, KSA. His current research interests include high performance computing, design and analysis of algorithms and e-learning systems for algorithms.

: The authors declare that they have no competing interests.

: Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.