China
Africa
Explore chapters and articles related to this topic
Basics of the Unix System
Published in Paul W. Ross, The Handbook of Software for Engineers and Scientists, 2018
F. Sanders Alton, Pickering Robert
The options for the sort command are: The sort command sorts one or more files. Each line of a file may be subdivided into fields that are separated by a delimiter (default a blank) so that sorts may be performed specific fields. As a simple exampe consider the file “fruit,” which has apparently been typed hastily and has inconsistencies with captals and lower case letters. Suppose the file contains
Big data processing with 1D-Crosspoint Arrays
Published in International Journal of Parallel, Emergent and Distributed Systems, 2023
Besides sorting networks, parallel versions of sorting algorithms have also been developed as general-purpose processors transitioned to multicore architectures. Examples include parallel Merge sort [1, p.159, p.385], [30], parallel Quicksort [31–33], and Bucket sort [34, p.77], [35, 36]. Some of these parallelized conventional algorithms were reported to have the theoretical minimum sorting time of for sorting n elements. However, similar to the AKS network, such algorithms have limitations in realistic scenarios. Cole's parallel merge sort is reported to be slower than Bitonic sorting networks due to high constant involved in the big-O notation [37], the parallel Quicksort requires a machine that is capable of concurrent write operation [32], and the -time parallel bucket sort can only sort integer elements [36].
Cognitive Evaluation of Examinees by Dynamic Question Set Generation based on Bloom’s Taxonomy
Published in IETE Journal of Research, 2023
Anjan Dutta, Punyasha Chatterjee, Nilanjan Dey, Pablo Moreno-Ger, Soumya Sen
In this work the questions are identified as a member of the particular level of Bloom’s taxonomy based on matching Bloom’s keyword at each level. There are some questions that fall under particular Bloom’s level semantically but Bloom’s keyword is missing in them Se.g. “find the time complexity of the Merge sort algorithm”. Semantically these questions falls under analysis level in Bloom’s taxonomy though there is no Bloom’s keyword. Moreover, sometimes hardness of the Moreover sometimes hardness of the questions falling in the same level of Bloom’s differ. As an example, the hardness of the following two questions is different- (i) “find out the time complexity of Bubble Sort” and (ii) “find out the time complexity of merge sort”. Both of these belong to analysis level but the second question is analytically more complex than the first one. Classifying and computing the hardness of these kinds of questions needs further analysis and research.
Lossless Compression of Hyperspectral Imagery by Assimilating Decorrelation and Pre-processing with Efficient Displaying Using Multiscale HDR Approach
Published in IETE Journal of Research, 2022
A. S. Anand Swamy, A. S. Mamatha, N. Shylashree, Vijay Nath
The good attributes of Merge Sort and Insertion Sort approaches are assimilated in the Heap Sorting technique. Heap is generally referred to by an array “X” defined as an object consisting of two features, (i) Length (X) denotes the total array elements, and the (ii) Heap-size [X], depicts the count of elements that are saved within array “X”, out of the total count of elements that were present in the heap. The Binary heaps are classified as min-heaps and max-heaps. The condition that the Heap property is met by the elements present at the nodes is satisfied in both max and min heaps respectively. Here max-heap is employed for the Heap Sorting algorithm. The underlying principle of max-heap is, at any given node, the merit of the prevailing element at the node is inevitably larger than its parent, failing which it is at least equal to its parent’s merit. It is stated as . This is applicable for all the nodes other than the root. The general representation for the node is “j”. The steps involved in Heap operation are as discussed below.