Enhanced Relative Comparison of Traditional Sorting Approaches towards Optimization of New Hybrid Two-in-One (OHTO) Novel Sorting Technique

Authors

  • Rajeshwari B S Department of CSE, B.M.S College of Engineering, Bull Temple Road, Basavanagudi, Bengaluru 560 019, India
  • C.B. Yogeesha Collaboration Technology Group, Cisco Systems India Private Limited, SEZ, Cessana Business Park, Marathahalli, Sarjapur, ORR, Kaadubesanahalli, Bengaluru 560 103, India
  • M. Vaishnavi Department of CSE, B.M.S College of Engineering, Bull Temple Road, Basavanagudi, Bengaluru 560 019, India
  • Yashita P. Jain Department of CSE, B.M.S College of Engineering, Bull Temple Road, Basavanagudi, Bengaluru 560 019, India
  • B.V. Ramyashree Department of CSE, B.M.S College of Engineering, Bull Temple Road, Basavanagudi, Bengaluru 560 019, India
  • Arpith Kumar Department of CSE, B.M.S College of Engineering, Bull Temple Road, Basavanagudi, Bengaluru 560 019, India

DOI:

https://doi.org/10.5614/itbj.ict.res.appl.2023.17.2.2

Keywords:

algorithm design technique, bubble sort, hybrid sorting, insertion sort, optimization, sorting, time complexity

Abstract

In the world of computer technology, sorting is an operation on a data set that involves ordering it in an increasing or decreasing fashion according to some linear relationship among the data items. With the rise in the generation of big data, the concept of big numbers has come into existence. When the number of records to be sorted is limited to thousands, traditional sorting approaches can be used; in such cases, complexities in their execution time can be ignored. However, in the case of big data, where processing times for billions or trillions of records are very long, time complexity is very significant. Therefore, an optimized sorting technique with efficient time complexity is very much required. Hence, in this paper an optimized sorting technique is proposed, named Optimized Hybrid Two-in-One Novel Sorting Technique (OHTO, a mixed approach of the Insertion Sort technique and the Bubble Sort technique. The proposed sorting technique uses the procedure of both Bubble Sort and Insertion Sort, resulting in fewer comparisons, fewer data movements, fewer data insertions, and less time complexity for any given input data set compared to existing sorting techniques.

Downloads

Download data is not yet available.

References

Prajapati, P., Bhatt, N. & Bhatt, N., Performance Comparison of Different Sorting Algorithms, International Journal of Latest Technology in Engineering, Management & Applied Science, 6(6), pp. 39-41, ISSN 2278-2540, 2017.

Gill, S.K., Singh, V.P., Sharma, P. & Kumar, D., A Comparative Study of Various Sorting Algorithms, International Journal of Advanced Studies of Scientific Research, 4(1), pp. 367-372, 2019.

Rustagi, S. & Yadav, T., A Comparative Study of Various Sorting Algorithms Optimized Sorting Process, International Journal of Technology & Management, 4(1), pp. 52-56, ISSN: 2454-8421, 2018.

Jadoon, S., Solehria, S.F. & Qayum, M., Optimized Selection Sort Algorithm is Faster than Insertion Sort Algorithm: A Comparative Study, International Journal of Electrical and Computer Sciences, 11(2), pp. 18-23, 2011.

Shabaz, M. & Kumar, A., SA Sorting: A Novel Sorting Technique for Large-Scale Data, Research Article ID 3027578, pp. 1-7, 2019. DOI: DOI: 10.115 5/2019/3027578.

Alnihoud, J. & Mansi, R., An Enhancement of Major Sorting Algorithms, The International Arab Journal of Information Technology, 7(1), pp. 55-62, 2010.

Mishra, A. & Goyal, G., An Optimized Input Sorting Algorithm, Global Journal of Computer Science and Technology: Network, Web & Security, 16(1), ISSN: 0975-4172, 2016.

Sodhi, T.S., Kaur, S. & Kaur, S., Enhanced Insertion Sort Algorithm, International Journal of Computer Applications, 64(21), pp. 35-39, 2013.

Chhatwani, P.K., Insertion Sort with its Enhancement, International Journal of Computer Science and Mobile Computing, 3(3), pp. 801-806, 2014.

Patelia, R.M., Vyas, S.D. & Vyas, P.S., An Analysis and Design of Optimized Bubble Sort Algorithm, International Journal of Research in Information Technology, 3(1), pp. 65-68, 2015.

Sharma, S., Kumar, V., Singh, P. & Singh, A., A Novel Algorithm for Optimized Sorting, International Journal of Scientific Research in Science, Engineering and Technology, 2(2), pp. 1072-1076, ISSN: 2395-1990, 2016.

Singh, S., Singh, R.S. & Mandoria, H.L., Left-Right Sort: A Novel Sorting Algorithm and Comparison with Insertion Sort, Bubble Sort and Selection Sort, International Journal of Engineering & Scientific Research, 3(10), pp. 47-59, ISSN: 2347-6532, 2015.

Yogeesha, C.B., Pujeri, R.V. & Veena, R.S., Randomized Algorithms: On the Improvement of Searching Techniques Using Probabilistic Linear Linked Skip Lists, International Conference on Advances in Computing -ICAdC http://link.springer.com/chapter/10.1007/978-81-322-0740-519, pp. 147-153.

Rajeshwari, B S, Singh, N., Ibaduddin, M.S., Singhal, I. & Sree Vidya, B S., A Novel Efficient Selection Sort Technique for the Larger Dataset, GIS Science Journal, 8(8), pp. 257-266, 2021.

Pujeri, R.V. & Yogeesha, CB., A Relative Study of Genetic Algorithms and Hopfield Neural Network to Optimize Shortest Path Routing Algorithms for Finding Drilling Holes on the Printed Circuit Board-PCB, Journal of Adv Research in Dynamical and Control Systems, 15(Special Issue), pp. 801-808, Dec 2017.

Downloads

Published

2023-08-31

How to Cite

B S, R., Yogeesha , C. ., Vaishnavi, M., Jain, Y. P., Ramyashree, B., & Kumar, A. . (2023). Enhanced Relative Comparison of Traditional Sorting Approaches towards Optimization of New Hybrid Two-in-One (OHTO) Novel Sorting Technique. Journal of ICT Research and Applications, 17(2), 151-166. https://doi.org/10.5614/itbj.ict.res.appl.2023.17.2.2

Issue

Section

Articles