Results 301 to 310 of about 5,697,479 (365)
Some of the next articles are maybe not open access.
2018 3rd International Conference for Convergence in Technology (I2CT), 2018
Sorting algorithms are a major area of research in computer science and engineering where the simple task of sorting the numbers leads to complex algorithms. In recent years, many researchers have proposed several sorting techniques to enhance time and space complexities of the algorithms.
openaire +1 more source
Sorting algorithms are a major area of research in computer science and engineering where the simple task of sorting the numbers leads to complex algorithms. In recent years, many researchers have proposed several sorting techniques to enhance time and space complexities of the algorithms.
openaire +1 more source
Optimizing sorting algorithms by using sorting networks
Formal Aspects of Computing, 2017Abstract In this paper, we show how the theory of sorting networks can be applied to synthesize optimized general-purpose sorting libraries. Standard sorting libraries are often based on combinations of the classic Quicksort algorithm, with insertion sort applied as base case for small, fixed, numbers of inputs.
Michael Codish +3 more
openaire +3 more sources
Bicomponent sorting algorithms
PROBLEMS IN PROGRAMMING, 2022he possibilities of improving sorting time parameters through preprocessing by stochastic sorting were investigated. The hypothesis that two-component stochastic + classical sorting outperforms classic one-component sorting in terms of time efficiency was experimentally confirmed. Sorting with different computational complexity is accepted as classical
V. I. Shynkarenko +4 more
openaire +1 more source
Analysis and Review of Sorting Algorithms
International journal of scientific engineering and research, 2014One of the fundamental issues in computer science is ordering a list of items. Although there is a huge number of sorting algorithms, sorting problem has attracted a great deal of research; because efficient sorting is important to optimize the use of ...
Gaurav Kocher, Nikita Agrawa
semanticscholar +1 more source
Proceedings of the 50th ACM Technical Symposium on Computer Science Education, 2019
For many years, beginning computer science students have been asked the seemingly simple question: what makes one algorithm better than another? Usually, this concept of "best-ness" is introduced with the many algorithms that are used to sort data. Thus, students are overwhelmed by the intricacies of sorting while simultaneously trying to understand ...
Connor Bain, Uri Wilensky
openaire +1 more source
For many years, beginning computer science students have been asked the seemingly simple question: what makes one algorithm better than another? Usually, this concept of "best-ness" is introduced with the many algorithms that are used to sort data. Thus, students are overwhelmed by the intricacies of sorting while simultaneously trying to understand ...
Connor Bain, Uri Wilensky
openaire +1 more source
2009 Second International Conference on Computer and Electrical Engineering, 2009
Sorting is an important concept in the field of Computer Sciences. In this paper we presents an incremental sorting algorithm, which traverses the list in both directions (right and left) comparing first element of the list, with next two elements, and comparing last element with previous two elements in the list.
Sardar Zafar Iqbal +2 more
openaire +1 more source
Sorting is an important concept in the field of Computer Sciences. In this paper we presents an incremental sorting algorithm, which traverses the list in both directions (right and left) comparing first element of the list, with next two elements, and comparing last element with previous two elements in the list.
Sardar Zafar Iqbal +2 more
openaire +1 more source
Algorithm 426: Merge sort algorithm [M1]
Communications of the ACM, 1972Sorting by means of a two-way merge has a reputation of requiring a clerically complicated and cumbersome program. This ALGOL 60 procedure demonstrates that, using recursion, an elegant and efficient algorithm can be designed, the correctness of which is easily proved [2].
openaire +2 more sources
Qureshi Sort: A new Sorting Algorithm
2009 2nd International Conference on Computer, Control and Communication, 2009This paper discusses a new sorting algorithm. This algorithm has best & average cases between O (3N) & O (4N) and for worst case it may be O (N2) or more swear both in speed and memory, but it has a great property to tell its worst case in the starting iteration loop so that it can be switched to other Sorting Algorithms in worst cases.
openaire +1 more source
2015 4th International Conference on Computer Science and Network Technology (ICCSNT), 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.
Anand Agrawal, Bhyravarapu Sriram
openaire +1 more source
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.
Anand Agrawal, Bhyravarapu Sriram
openaire +1 more source
2016 SAI Computing Conference (SAI), 2016
Computing algorithms are a basic research area in computer science. In last years, many researchers proposed several sorting techniques to enhance time complexity and space complexity [8]. In this paper we present a sorting algorithm for any datatype, which uses mapping methodology.
Hoda Osama, Yasser Omar, Amr Badr
openaire +1 more source
Computing algorithms are a basic research area in computer science. In last years, many researchers proposed several sorting techniques to enhance time complexity and space complexity [8]. In this paper we present a sorting algorithm for any datatype, which uses mapping methodology.
Hoda Osama, Yasser Omar, Amr Badr
openaire +1 more source