Abstract
Proper ordering of data has always grabbed the attention of mankind. Researchers have always put forward their ideas for efficient sorting. A new method of sorting a large number of data in an array has been presented which is an iterative approach of sorting. The proposed method calculates an interval value from user input. Avoid repeated successive scan and repeated adjacent swap by comparing at the intervals. Promise to take less time to sort both small and large data than the existing sorting methods.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Langsam, Y., Tenenbum, A.M.: Data Structures Using c and c ++, 2nd edn. Indian printing (Prentice Hall of India private limited), New Delhi-110001
Lipschutz, S.: Data Structure & Algorithm, 2nd edn. Schaum’s Outlines Tata McGraw Hill, ISBN13: 9780070991309
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press and McGraw-Hill (2001). ISBN 0-262-03293-7. Problem 2-2, pp. 38
Knuth, D.: The Art of Computer Programming, vol. 3: Sorting and Searching, 3rd edn. Addison-Wesley (1997). ISBN 0-201- 89685-0. pp. 106–110 of section 5.2.2: Sorting by Exchanging
Ergül, O.: Guide to Programming and Algorithms Using R. Springer, London (2013). ISBN 978-1-4471-5327-6
Yu, P., Yang, Y., Gan, Y.: Experiment analysis on the bubble sort algorithm and its improved algorithms. In: Information Engineering and Applications. Lecture Notes in Electrical Engineering, vol. 154, pp. 95–102. Springer, London (2002)
Min, W.: Analysis on Bubble Sort algorithm optimization. In: 2010 International Forum on IEEE Information Technology and Applications (IFITA), Kunming, China (2010)
Yu, P., Yang, Y., Gan, Y.: Experimental study on the five sort algorithms. In: 2011 Second International Conference on IEEE Mechanic Automation and Control Engineering (MACE), China (2011)
www.answers.com/Q/What_are_advantages_and_disadvantages_of_selection_sort
www.answers.com/Q/What_are_advantages_and_disadvantages_of_insertion_sort
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Sultana, N., Paira, S., Chandra, S., Alam, S.S. (2018). A Mid-Value Based Sorting. In: Das, S., Chaki, N. (eds) Algorithms and Applications . Smart Innovation, Systems and Technologies, vol 88. Springer, Singapore. https://doi.org/10.1007/978-981-10-8102-6_5
Download citation
DOI: https://doi.org/10.1007/978-981-10-8102-6_5
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-10-8101-9
Online ISBN: 978-981-10-8102-6
eBook Packages: EngineeringEngineering (R0)