Melola Discovery

← Melola Discovery

Jurnal SINTA 2

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 (JICTRA) · Vol. 17 No. 2 (2023) · pp. 151–166

DOI
10.5614/itbj.ict.res.appl.2023.17.2.2
ISSN
2338-5499, 2337-5787
Published
2023-08-31
Publisher
DRI - ITB
Language
eng

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.

Keywords

Collaboration network of the authors

8 authors · 18 co-authorship links

Hover or tap a name to highlight its co-authors. Double-click to open the author's page.

  • B.M.S. College of Engineering
  • Affiliation unknown
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles
M. DakshayiniB.M.S. College of Engineering1
Hassan Sadashiva GuruprasadB.M.S. College of Engineering1

Affiliations come from OpenAlex; journal OAI-PMH metadata carries none. Authors without an OpenAlex ID are matched by name, which can merge or split people.

Metadata source: OAI-PMH (metadata jurnal) https://journals.itb.ac.id/index.php/jictra/oai, first harvested 26 Okt 2026, last seen 26 Okt 2026.
Original metadata (oai_dc) 
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/  http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">Enhanced Relative Comparison of Traditional Sorting Approaches towards Optimization of New Hybrid Two-in-One (OHTO) Novel Sorting Technique</dc:title>
	<dc:creator>B S, Rajeshwari</dc:creator>
	<dc:creator>Yogeesha , C.B. </dc:creator>
	<dc:creator>Vaishnavi, M.</dc:creator>
	<dc:creator>Jain, Yashita P.</dc:creator>
	<dc:creator>Ramyashree, B.V.</dc:creator>
	<dc:creator>Kumar, Arpith </dc:creator>
	<dc:subject xml:lang="en-US">algorithm design technique</dc:subject>
	<dc:subject xml:lang="en-US">bubble sort</dc:subject>
	<dc:subject xml:lang="en-US">hybrid sorting</dc:subject>
	<dc:subject xml:lang="en-US">insertion sort</dc:subject>
	<dc:subject xml:lang="en-US">optimization</dc:subject>
	<dc:subject xml:lang="en-US">sorting</dc:subject>
	<dc:subject xml:lang="en-US">time complexity</dc:subject>
	<dc:description xml:lang="en-US">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.</dc:description>
	<dc:publisher xml:lang="en-US">DRI - ITB</dc:publisher>
	<dc:date>2023-08-31</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://journals.itb.ac.id/index.php/jictra/article/view/18690</dc:identifier>
	<dc:identifier>10.5614/itbj.ict.res.appl.2023.17.2.2</dc:identifier>
	<dc:source xml:lang="en-US">Journal of ICT Research and Applications; Vol. 17 No. 2 (2023); 151-166</dc:source>
	<dc:source>2338-5499</dc:source>
	<dc:source>2337-5787</dc:source>
	<dc:source>10.5614/itbj.ict.res.appl.2023.17.2</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://journals.itb.ac.id/index.php/jictra/article/view/18690/6294</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2023 Journal of ICT Research and Applications</dc:rights>
</oai_dc:dc>