Results 231 to 240 of about 283,157 (282)
Some of the next articles are maybe not open access.
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
This article presents a detailed analysis of sorting algorithms, highlighting their implementations, efficiencies and practical applications. Through extensive benchmarking with datasets of varying sizes (10,000 to 100,000 elements) and characteristics (random, partially ordered, reverse ordered), we demonstrate that hybrid algorithms like Timsort ...
openaire +1 more source
openaire +1 more source
Nuclear Instruments and Methods in Physics Research Section A: Accelerators, Spectrometers, Detectors and Associated Equipment, 1996
Abstract Several new algorithms for sorting of dipole and/or quadrupole magnets in synchrotrons and storage rings are described. The algorithms make use of a combinatorial approach to the problem and belong to the class of random search algorithms. They use an appropriate metrization of the state space. The phase-space distortion (smear) is used as a
openaire +1 more source
Abstract Several new algorithms for sorting of dipole and/or quadrupole magnets in synchrotrons and storage rings are described. The algorithms make use of a combinatorial approach to the problem and belong to the class of random search algorithms. They use an appropriate metrization of the state space. The phase-space distortion (smear) is used as a
openaire +1 more source
1984
Publisher Summary This chapter presents a survey on various parallel sorting algorithms. Sorting is a nontrivial problem and has widespread commercial and business applications. Serial algorithms for sorting have been available since the days of punched-card machines. At present, there is a considerable body of literature on serial sorting algorithms.
S. Lakshmivarahan +2 more
openaire +1 more source
Publisher Summary This chapter presents a survey on various parallel sorting algorithms. Sorting is a nontrivial problem and has widespread commercial and business applications. Serial algorithms for sorting have been available since the days of punched-card machines. At present, there is a considerable body of literature on serial sorting algorithms.
S. Lakshmivarahan +2 more
openaire +1 more source
2017
Sorting algorithm remained hot topic in computer science from the birth of computer science to achieve maximum performance. Fortunately this achievement became possible due to good and fast sorting algorithms, such as heap sort, merge sort, radix sort and other sorting algorithms.
Adeel Ahmed +5 more
openaire +1 more source
Sorting algorithm remained hot topic in computer science from the birth of computer science to achieve maximum performance. Fortunately this achievement became possible due to good and fast sorting algorithms, such as heap sort, merge sort, radix sort and other sorting algorithms.
Adeel Ahmed +5 more
openaire +1 more source