Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 2,376 papers for “array sorting”

Sorting the quasi ordered array

В. П. Гамаюн · Problems of Informatization and Management · 2019

In organizing a computational process with a task-algorithmic design method, the main step in stitching a set of algorithms into a generalized block scheme is to select a frequently used algorithm, which is then structurally implemented in an operational machine. In the classical construction of computer tools, such a general algorithm is addition, other algorithms are implemented with the support of this basic one. The software together with the operational (structural) machine makes up the operational basis. The article considers the proposal to build a new operational basis of computer tools for high-precision processing of computer tools and systems. High-precision processing is implemented through the bit-logarithmic representation. The basic operation in which is the sorting of arrays whose elements are short digital codes. Sorting is done to arrange arrays. When performing operations in bitwise logarithmic coding, arrays are in some way (not completely) ordered. Therefore, the statement of the problem is chosen precisely under such conditions. The main solution to the problem is proposed in several stages. Array ordering by blocks with boundary values, ordering inside blocks and docking blocks with each other with "overlapping" boundary elements of blocks. Then repeat the sorting within the blocks and the subsequent “overlap”. Sorting ends when there are no unordered items. Modeling determines the reduction of sorting steps by one or two orders of magnitude compared to sorting by the "bubble" method on a hypothetical parallel structure. Improving the basic operation determines the positive performance of the new operational basis as a whole.

Cited by 0Open access

PHP Array Sorting Algorithms Analysis

hosseini, seyed sajjad · Zenodo (CERN European Organization for Nuclear Research) · 2025

This project analyzes and compares three fundamental array sorting algorithms implemented in PHP — Bubble Sort, Selection Sort, and Quick Sort. It evaluates their time and space complexities, provides benchmark results on a dataset of 1000 integers, and discusses their practical performance differences. The aim is to help PHP developers understand the efficiency and applicability of these sorting methods in real-world applications.

Cited by 0Open access

Data sorting modes of phoswich detector array

R. Li, Douglas V. Verney, C. Delafosse et al. · Nuclear Instruments and Methods in Physics Research Section A Accelerators Spectrometers Detectors and Associated Equipment · 2026

Cited by 0Open access

Array-indexed sorting algorithm for natural numbers

D. R. Ramesh Babu, Shiva Shankar Reddy, V.P. Arul Kumar et al. · 2011

In this paper we present a sorting algorithm for natural numbers, which uses the methodology of indexing of the array and insert that number into proper index of the array without performing any element comparisons and swapping. This algorithm efficiently 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.

Cited by 4

Data sorting modes of phoswich detector array

Li, R., Verney, D., Delafosse, C. et al. · arXiv (Cornell University) · 2025

The different data-sorting modes of the phoswich detector array PARIS used for detecting high-energy (4$-$10 MeV) $γ$ rays are investigated. The characteristics including time resolution, energy resolution and detection efficiency under various modes are studied. The present study shows that PARIS has capabilities of rejecting escape and pileup events when used for decay spectroscopy. Notably, the methods presented in this work refer specifically to the $β$-decay experiment of $^{80g+m}$Ga conducted with three PARIS clusters comprising 27 phoswich detectors, rather than to a general report on the PARIS array or its overall performance for in-beam spectroscopy. Compared with the 2"$\times$2"$\times$2" LaBr$_3$(Ce) detector (Ciemała et al., 2009), even in individual mode, PARIS provides significant suppression of single- and double-escape peaks and reduces background via vetoing function of the outer-volume NaI(Tl) crystals. In contrast to the common approach of adding back the energies in LaBr$_3$(Ce) and NaI(Tl) to increase the detection efficiency of the full-energy peak, using NaI(Tl) as a veto shield provides a superior trade-off for applications where spectral purity is essential. Employing add-back analysis within each cluster of nine phoswiches or between all phoswiches could enhance full-energy peak efficiency and further suppress escape peaks and background. Applying a multiplicity condition provides a further suppression but simultaneously lowers the statistics of full-energy peaks.

Cited by 0Open access

On An Array Sorting Problem of Kosaraju.

Lipton,Richard J, Raymond E. Miller, Lori Unruh Snyder · Defense Technical Information Center (DTIC) · 1977

An array sorting problem is shown to have a linear lower time bound for n x n arrays. This negatively settles a conjecture of Kosaraju. Several other sorting schemes are considered, but all fail to improve performance. The impossibility of better than linear time sorting bounds for arrays with local rules is conjectured.

Cited by 0

Standardized parallel sorting on SIMD array processor

Tianzhen Wang, Li Zhou, Qin Xiozhen · 2002

We present the standardized parallel sorting algorithm. Instead of the most basic CCI (compare and conditional interchange) operation in traditional sorting algorithms, this algorithm compares sorting data with a standard value sequence simultaneously and synchronously on an SIMD array processor. The algorithm possesses three significant advantages. First, the running time T is independent of the problem size, T=0(1). The second attractive feature of the algorithm is that it is not necessary to build a communication network between PEs. Finally, no bottleneck occurs in output. We have implemented the algorithm in an SIMD array processor that is designed by our research group. The experiment verifies all the theoretical predictions. For these merits the algorithm is of significance in both theory and practice.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

Cited by 0

Object sorting using a distributed manipulator array

Declan Walsh, Piotr Dudek · 2014

A cellular array algorithm is presented which allows the manipulation of objects across a distributed manipulator array. Objects are placed on the manipulator array surface and the algorithm differentiates between two different types of objects depending on their physical properties. The different objects are then controlled by the algorithm and the manipulator array so that the objects end up grouped together in different regions of the manipulator array. The algorithm has been verified using a physics-based 3D simulation engine.

Cited by 1

Array Sorting Algorithm vs Traditional Sorting Algorithm: Memory and Time Efficiency Analysis

Imam Prayogo Pujiono, Eko Hari Rachmawanto, Nurul Anisa Sri Winarsih · Jurnal Manajemen Informatika (JAMIKA) · 2025

The development of information technology has changed various aspects of life, including the way we store and sort data. Data that used to be stored in filing cabinets is now stored in digital form on computers. However, digital data that is not well organised can make it difficult to search and verify. Therefore, data sorting has become very important, and various sorting algorithms have been developed to fulfil this need, such as the Array Sorting Algorithm (ASA), which is claimed to have efficient time complexity and is very competitive when compared to the time complexity of traditional algorithms. This research examines the memory efficiency and computation time between ASA and five traditional sorting algorithms (Bubble Sort, Shell Sort, Merge Sort, Quick Sort, and Heap Sort) using the Java programming language. The research was conducted by utilising random numerical datasets on three different scales (100, 1,000, and 10,000 data) to test the performance of the six algorithms in various scenarios. ASA, which utilises a two-dimensional array structure to manage element frequencies, showed impressive performance in terms of computation time, especially on datasets containing 1,000 and 10,000 data, compared to traditional algorithms that focus more on comparison and recursion methods. The test results confirm that on datasets of 1,000 and 10,000 data, ASA excels in terms of computational speed but loses in terms of memory usage. Therefore, if memory usage is not a major consideration, then ASA is a very suitable sorting algorithm for sorting data of 100 - 10,000. These findings provide important insights for the selection of efficient sorting algorithms based on memory efficiency and computation time on multiple data sizes, which is particularly useful when developing applications using the Java programming language.

Cited by 0Open access

A Scalable Addressable Positive-Dielectrophoretic\nCell-Sorting Array

Brian M. Taff (2459359), Joel Voldman (109682) · Figshare · 2016

We present the first known implementation of a passive,\nscalable architecture for trapping, imaging, and sorting\nindividual microparticles, including cells, using a positive\ndielectrophoretic (p-DEP) trapping array. Our array-based\ntechnology enables “active coverslips” where, when scaled,\nmany individually held cells can be sorted based upon\nimaged spatial or temporally variant characteristics. Our\ndesign incorporates a unique “ring-dot” p-DEP trap\ngeometry organized in a row/column array format. This\ntrap design, implemented in a two-level metal process,\nprovides strong and highly spatially localized holding\nfields enabling single-cell capture for all traps in the array.\nWe release individual trapped microparticles during sorting using a passive transistor-independent approach\nwhere we electrically ground the row and column electrodes associated with specific traps in the array. The\ndemand for chip-to-world electrical connections in our\narrays scales proportionally with the square root of the\nnumber of traps in a given array, delivering a substantial\nimprovement over prior designs. We demonstrate capture, holding, and release operations with both beads and\ncells in small arrays of this new architecture.

Cited by 0Open access

A Scalable Addressable Positive-Dielectrophoretic Cell-Sorting Array

Brian M. Taff, Joel Voldman · Analytical Chemistry · 2005

We present the first known implementation of a passive, scalable architecture for trapping, imaging, and sorting individual microparticles, including cells, using a positive dielectrophoretic (p-DEP) trapping array. Our array-based technology enables "active coverslips" where, when scaled, many individually held cells can be sorted based upon imaged spatial or temporally variant characteristics. Our design incorporates a unique "ring-dot" p-DEP trap geometry organized in a row/column array format. This trap design, implemented in a two-level metal process, provides strong and highly spatially localized holding fields enabling single-cell capture for all traps in the array. We release individual trapped microparticles during sorting using a passive transistor-independent approach where we electrically ground the row and column electrodes associated with specific traps in the array. The demand for chip-to-world electrical connections in our arrays scales proportionally with the square root of the number of traps in a given array, delivering a substantial improvement over prior designs. We demonstrate capture, holding, and release operations with both beads and cells in small arrays of this new architecture.

Cited by 185

A Scalable Addressable Positive-Dielectrophoretic\nCell-Sorting Array

Brian M. Taff (2459359), Joel Voldman (109682) · Figshare · 2016

We present the first known implementation of a passive,\nscalable architecture for trapping, imaging, and sorting\nindividual microparticles, including cells, using a positive\ndielectrophoretic (p-DEP) trapping array. Our array-based\ntechnology enables “active coverslips” where, when scaled,\nmany individually held cells can be sorted based upon\nimaged spatial or temporally variant characteristics. Our\ndesign incorporates a unique “ring-dot” p-DEP trap\ngeometry organized in a row/column array format. This\ntrap design, implemented in a two-level metal process,\nprovides strong and highly spatially localized holding\nfields enabling single-cell capture for all traps in the array.\nWe release individual trapped microparticles during sorting using a passive transistor-independent approach\nwhere we electrically ground the row and column electrodes associated with specific traps in the array. The\ndemand for chip-to-world electrical connections in our\narrays scales proportionally with the square root of the\nnumber of traps in a given array, delivering a substantial\nimprovement over prior designs. We demonstrate capture, holding, and release operations with both beads and\ncells in small arrays of this new architecture.

Cited by 0Open access

Microfluidic sorting with a moving array of optical traps

Raktim Dasgupta, Sunita Ahlawat, P. K. Gupta · Applied Optics · 2012

Optical sorting was demonstrated by selective trapping of a set of microspheres (having specific size or composition) from a flowing mixture and guiding these in the desired direction by a moving array of optical traps. The approach exploits the fact that whereas the fluid drag force varies linearly with particle size, the optical gradient force has a more complex dependence on the particle size and also on its optical properties. Therefore, the ratio of these two forces is unique for different types of flowing particles. Selective trapping of a particular type of particles can thus be achieved by ensuring that the ratio between fluid drag and optical gradient force on these is below unity whereas for others it exceeds unity. Thereafter, the trapped particles can be sorted using a motion of the trapping sites towards the output. Because in this method the trapping force seen by the selected fraction of particles can be suitably higher than the fluid drag force, the particles can be captured and sorted from a fast fluid flow (about 150 μm/s). Therefore, even when using a dilute particle suspension, where the colloidal trafficking issues are naturally minimized, due to high flow rate a good throughput (about 30 particles/s) can be obtained. Experiments were performed to demonstrate sorting between silica spheres of different sizes (2, 3, and 5 μm) and between 3 μm size silica and polystyrene spheres.

Cited by 12