China
Africa
Explore chapters and articles related to this topic
Statistical Calculations
Published in Julio Sanchez, Maria P. Canton, Software Solutions for Engineers and Scientists, 2018
Julio Sanchez, Maria P. Canton
Many sorting algorithms have been devised, some of which are quite elaborate. The easiest to understand and implement is probably the infamous bubble sort, which is also one of the least efficient ones. The so-called selection sort is easy to implement and offers acceptable performance for the purpose at hand. The following template function implements the sorting in ascending order of array data.
Binarily Gapped Binary Insertion Sorting Technique
Published in IETE Journal of Research, 2018
Swapan Kumar Ray, Surajeet Ghosh
Sorting of an array of data elements (DE) is a fundamental operation in computer science and is a basic requirement in many engineering and commercial systems that perform searching or displaying of data. It is also a key subroutine used in running many formal algorithms. A host of different sorting techniques exists [1,2] which often meet the various general performance criteria like sorting time, memory requirement, implementational simplicity, etc. of different applications. An important feature in a sorting technique is its in-place operation which implies that, during the process of sorting, a constant number of DEs of the input unsorted array is ever stored outside the array. Among the most well-known in-place sorting algorithms are the Heap Sort, the Quick Sort, and the Insertion Sort, which, respectively, sorts n numbers in O(nlog n), O(nlog n), and O(n2) time [1,2]. In spite of its relatively poor performance as an in-place sorting technique, the Insertion Sort counts among the popular sorting techniques because it is simple, incremental (i.e., on line), stable, more efficient than most of the other simple O(n2) algorithms like Selection Sort or Bubble Sort, and, finally, its output array remains sorted all the time – both before and after every insertion.