Two Approaches of Natural Numbers Sorting: TAISN and Improved Array-Indexed Algorithms
نویسندگان
چکیده
Data Structure is one of the fundamental areas of the computer science. Sorting is crucial in data structure, which creates the list of sequence items. In this paper, we present two techniques of sorting algorithm for natural numbers, which uses the array indexing methodology and insert that number into the proper index of the array without performing any element comparisons and swapping. The first algorithm improves ArrayIndexed Sorting Algorithm for natural numbers [1] by adding negative numbers. The second algorithm is a new sorting algorithm that refers to Two Arrays-Indexed Sorting Algorithm for Natural Numbers (TAISN). The two techniques of sorting algorithm for natural numbers are efficient to give a much better performance than the existing sorting algorithms of the O(n2) class, for large array size with same length of digits of input data.
منابع مشابه
Design, Development and Evaluation of an Orange Sorter Based on Machine Vision and Artificial Neural Network Techniques
ABSTRACT- The high production of orange fruit in Iran calls for quality sorting of this product as a requirement for entering global markets. This study was devoted to the development of an automatic fruit sorter based on size. The hardware consisted of two units. An image acquisition apparatus equipped with a camera, a robotic arm and controller circuits. The second unit consisted of a robotic...
متن کاملA new indexed approach to render the attractors of Kleinian groups
One widespread procedure to render the attractor of Kleinian groups, appearing in the renown book [8], wantshuge memory resources to compute and store the results. We present a new faster and lighter version that drops the original array and pulls out group elements from integers.
متن کاملKnitting Sort: A Novel Stable and Inplace Sorting Technique (An Extension of Exchange Sorting with Bitonic Sorting Network)
One of the most frequent operations performed on database is searching. To perform this operation we have different kinds of searching algorithms, some of which are Binary Search, Linear Search, Quadratic search[1], but these and all other searching algorithms work only on data, which are previously sorted. An efficient algorithm is required in order to make the searching algorithm fast and eff...
متن کاملIPS, sorting by transforming an array into its own sorting permutation with almost no space overhead
This paper presents two new algorithms for inline transforming an integer array ‘a’ into its own sorting permutation that is: after performing either of these algorithms, a[i] is the index in the unsorted input array ‘a’ of its i’th largest element (i=0,1..n-1). The difference between the two IPS (Inline Permutation Substitution) algorithms is that the first and fastest generates an unstable pe...
متن کاملNatural Convection Heat Transfer From Horizontal Cylinders in a Vertical Arra Confined Between Parallel Walls
Laminar natural convection from an array of horizontal isothermal cylinders confined between two vertical walls, at low Rayleigh numbers, is investigated by theoretical and numerical methods. The height of the walls is kept constant, however, number of the cylinders and their spacing, the distance between the walls and Rayleigh number have been varied. The optimal spacing (confining walls) and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015