Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 10,000 papers for “Sorting algorithm”

Concom sorting algorithm

Anand Agrawal, Sriram Bhyravarapu · 2015

In Data Structures, sorting is a technique which is used for arranging data in a particular order either ascending or descending. Sorting techniques like Bubble sort, Insertion sort and Selection sort are comparison based. Our proposed technique is a combination of both comparison and counting based techniques. We are finding the exact position of an element and placing it in its corresponding position. A sorting technique is said to be optimal based on its time & space complexity. The algorithm we designed is said to be optimal, based on the number of swap's compared to existing techniques like bubble sort, insertion sort.

Cited by 6

Bitonic Sorting Algorithm

Justin R Smith · 1993

Abstract In this section we will discuss one of the first parallel sorting algorithms to be developed. DEFINillON 3.1. A sequence of numbers will be called bitonic if either of the following two conditions is satisfied: It starts out being monotonically increasing up to some point and then becomes monotonically decreasing. It starts out being monotonically decreasing up to some point and then becomes monotonically increasing. A sequence of O ‘s and l ‘s will be called clean if it consists entirely of O ‘s or entirely of l ‘s.

Cited by 1

Sorting Algorithm Simulator

Křivák, Jan · Brno University of Technology Digital Library (Brno University of Technology) · 2025

Cílem této práce bylo vytvořit vzdělávací aplikaci zaměřenou na vizualizaci a analýzu řadicích algoritmů. Hlavním přínosem je umožnit uživatelům, zejména studentům informatiky, lépe pochopit principy algoritmů prostřednictvím interaktivní simulace. Aplikace poskytuje možnost sledovat průběh jednotlivých kroků algoritmu a analyzovat časovou a prostorovou složitost pomocí metody nejmenších čtverců. Navíc umožňuje modifikovat zdrojový kód algoritmů. Implementované řešení bylo ověřeno jak automatickým testováním, tak i uživatelskými testy. V rámci experimentálního ověření bylo dosaženo 100% přesnosti v odhadu složitosti u většiny algoritmů, u quick sort pak ve 93 % případů.

Cited by 0Open access

Sorting Algorithm Visualization

Karki, Bikram · Theseus (Ammattikorkeakoulujen) · 2021

Algorithm is an integral part of computers and programming. It provides consistency in solving similar tasks with a predictable and desirable outcome. Among algorithms, sorting algorithms are regarded as the gateway to the world of algorithms in programming. Evident by their definition, they are used to sorting data set with similar properties. There are various types of sorting algorithms with their distinct implementations and strategies. They are often not as easy to understand and absorb. A possible contributing factor can be the lack of visualization of the process and steps each one takes to accomplish the task of sorting. Thus, the objective of this thesis was to create a web application as a visualization tool for three common sorting algorithms namely Bubble sort, Merge sort, and Quick sort.
\n
\nThe result was a web application built using React and other modern JavaScript technologies. The application UI was able to visualize the sorting process using various colors or denote the status of the elements in the array. It includes features to select the size of the data (array of random numbers), visualization speed, sorting algorithm. Along with that, an extra feature for accessibility called color mode is also present for anyone with a medical condition that is affected by flashing colors.
\n
\nThe main objective of the thesis was met. However, the application can be improved further in terms of responsiveness and support mobile devices, design, and more options of sorting algorithms, etc.

Cited by 0

CSB Sorting Algorithm

Anjali Arora · 2015

Abstract- Sorting is a term which is very commonly used in computer science. It is a process of arranging items according to a certain order or in a particular sequence. The algorithm which are used for sorting generally consist of operations that includes comparison, swapping and assignment, as well as it may facilitate some other operations such as searching, arranging and merging of data. In this paper we proposed a new algorithm which is a combination of selection sort and bubble sort. During each iteration the smallest and largest elements are placed at its appropriate location. In our proposed approach, we reduces the running time complexity of selection sort in best case scenario and also improving the running time of bubble sort in worst cases.Observations and results are reported in support of the proposed idea.

Cited by 0

Sorting Algorithm visualizer

Aditya Thakkar, Kavita Kavita, Sonali Dash et al. · 2022 International Conference on Cyber Resilience (ICCR) · 2022

Visual learning is one of the most effective ways to grasp the knowledge of anything. Algorithm visualization demonstrates operation of logic in a pictorial manner, this enhances the knowledge and simplifies the understanding. In this paper, We address the need for a pictorial explanation of algorithms and suggest solution to visualize sorting algorithms by building a web application and explore probable future directions based on our own findings and observations using objective checklist of the web application.

Cited by 14

NK-SORTING ALGORITHM

Nidhal K. El Abbadi, ZAID YAHYA A. KAREEM · Journal of Kufa for Mathematics and Computer · 2011

Sorting has been a profound area for the algorithmic researchers and many resources are invested to suggest more works for sorting algorithms. For this purpose, many existing sorting algorithms were observed in terms of the efficiency of the algorithmic complexity.Many algorithms are very well known for sorting the unordered lists.In this proposed algorithm, we suggested a new algorithm for sorting integers number depending on dividing the input array to many sub-arrays (which represents a vector or array with one dimension), according to the number of digits in each integer number, the relation between sub-array elements is determined, and this relation used to determines the right location of each element in sub-arrays. Collision may happen, which is solved by moving elements in sub-array to next location. Finally, all ordered sub-arrays will be merged together to rebuild the origin array. The proposed algorithm compared with many famous algorithms gives promising results.Â

Cited by 1Open access

Algorithm for interactive sorting

Turtiainen, Petteri · Aaltodoc (Aalto University) · 2016

Sekä ihmisille että koneille on vaikeaa järjestää aineistoa, jossa järjestys määräytyy käyttäjän subjektiivisen kokemuksen kautta. Tällaisia aineistoja ovat esimerkiksi listaukset, joihin on valittu kymmenen parasta elokuvaa tai kirjaa. Koska käyttäjän kokemuksella kirjasta ei ole numeerista arvoa, tietokone ei pysty itse järjestämään aineistoa, vaan tarvitsee tähän käyttäjän syötettä. Tässä työssä kehitimme yleiskäyttöisen interaktiivisen algoritmin, joka toistuvasti kysyy käyttäjältä tietoa järjestettävien tietoalkioiden välisestä suhteellisesta suuruusjärjestyksestä ja täydentää suuruusjärjestystä mallintavaa suunnattua verkkoa. Käyttämällä topologista järjestämistä, algoritmi järjestää tietoalkiot tuloslistaksi. Algoritmi on suunniteltu virhesietoiseksi ja itseään korjaavaksi käyttäjän virheiden varalta. Se ei myöskään ota kantaa järjestettävän aineiston tyyppiin. Algoritmi osoittautui tehokkaaksi lyhyiden listojen järjestämisessä ja käyttäjän virheistä huolimatta pystyy tuottamaan enimmäkseen oikean lopputuloksen. Tämän työn pohjalta on mahdollista jatkokehittää algoritmia erityisempiä käyttötarkoituksia varten, kuten asiakaspalautteen ja tutkimusmateriaalin keräämiseen tai muiden sovellusten osana.

Cited by 0Open access