Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.
About 8,242 papers for “sorting algorithms”
Lýsek, Jiří · Brno University of Technology Digital Library (Brno University of Technology) · 2008
Práce se zabývá problémem třídění polí, který patří mezi známé problémy informatiky. Definuje pojmy třídění, algoritmus a složitost algoritmů. Popisuje vybrané algoritmy pro třídění od nejjednodušších po vybrané složitější konstrukce. Nakonec jsou algoritmy porovnány v závislosti na počtu operací a době trvání celého procesu.
Cited by 0Open access
Jan Richter · Digital Repository (National Repository of Grey Literature) · 2008
The bachelor thesis deals with basic types of sorting algorithms. We are able to divide these algorithms into two groups, which are elementary (direct) sorting algorithms and difficult (optimized) ones. From the group of direct algorithms, the thesis is dedicated to algorithms of direct paste, direct selection, and direct exchange, which could be further divided into bubblesort and shakersort. From the second group of optimized algorithms in the thesis, sorting with miniaturizing of steps (Shellsort) and dividing sorting (Quicksort) are described. In context of these algorithms, I deal with syntaxes and also effectiveness, with which they are able to sort the given system. Criteria of effectiveness are comparison and movement calculations, which are the function of only one parameter – the number of members in the system.
Cited by 0
Abibou, Ramatou · Infoscience (Ecole Polytechnique Fédérale de Lausanne) · 2007
Implementation of a variety of sorting algorithms, and look at their behavior and running times on different inputs.
Cited by 0Open access
Richter, Jan · Brno University of Technology Digital Library (Brno University of Technology) · 2008
Bakalářská práce pojednává o základních typech třídicích algoritmů. Algoritmy lze rozdělit do dvou skupin - na jednoduché (přímé) a na složitější (optimalizované). Z přímých algoritmů třídění je práce věnována algoritmům přímé vkládání, přímý výběr a přímá výměna, kterou lze ještě rozdělit na třídění bublinové a třídění přetřásáním. Z optimalizovaných algoritmů je v práci popsáno třídění se zmenšováním kroku (Shellovo třídění) a třídění rozdělováním (Quicksort). U zmíněných algoritmů se zabývám syntaxemi a také efektivností, s jakou jsou schopny utřídit danou množinu. Měřítkem efektivnosti jsou počty porovnávání a přesunů, které jsou funkcemi jediné proměnné, a to počtu prvků neuspořádané množiny.
Cited by 0Open access
Jan Richter · Digital Repository (National Repository of Grey Literature) · 2008
The bachelor thesis deals with basic types of sorting algorithms. We are able to divide these algorithms into two groups, which are elementary (direct) sorting algorithms and difficult (optimized) ones. From the group of direct algorithms, the thesis is dedicated to algorithms of direct paste, direct selection, and direct exchange, which could be further divided into bubblesort and shakersort. From the second group of optimized algorithms in the thesis, sorting with miniaturizing of steps (Shellsort) and dividing sorting (Quicksort) are described. In context of these algorithms, I deal with syntaxes and also effectiveness, with which they are able to sort the given system. Criteria of effectiveness are comparison and movement calculations, which are the function of only one parameter – the number of members in the system.
Cited by 0
Jakub Schwarz · Digital Repository (National Repository of Grey Literature) · 2011
Enormous volume of data, which has been processed during production operations, requires easy orientation and quick searching. Exact search in real time is essential for success. Correct and quick data-sorting is one of the most important activity during dataprocessing. The goal of this bachelor’s thesis is background research of sorting algorithms. To achieve the goal, basic concepts of sorting theory will be described (determined) and there will be division of sorting algorithms by different criterions. For each algorithm of internal array sorting, sorting principles will be described and analysis of efficiency will be provided. The results will be verified by experimental program.
Cited by 0
Jakub Schwarz · Digital Repository (National Repository of Grey Literature) · 2011
Enormous volume of data, which has been processed during production operations, requires easy orientation and quick searching. Exact search in real time is essential for success. Correct and quick data-sorting is one of the most important activity during dataprocessing. The goal of this bachelor’s thesis is background research of sorting algorithms. To achieve the goal, basic concepts of sorting theory will be described (determined) and there will be division of sorting algorithms by different criterions. For each algorithm of internal array sorting, sorting principles will be described and analysis of efficiency will be provided. The results will be verified by experimental program.
Cited by 0
Jiří Lýsek · Digital Repository (National Repository of Grey Literature) · 2008
This thesis deals with a problem of sorting arrays, which is one of known problems in computer science. It defines concepts of sorting, algorithm and algorithm complexity. It describes sorting algorithms from the easiest ones to the selected more difficult methods. Finally, the algorithms are compared according to number of needed operations and time needed for the whole sorting process.
Cited by 0
Jiří Lýsek · Digital Repository (National Repository of Grey Literature) · 2008
This thesis deals with a problem of sorting arrays, which is one of known problems in computer science. It defines concepts of sorting, algorithm and algorithm complexity. It describes sorting algorithms from the easiest ones to the selected more difficult methods. Finally, the algorithms are compared according to number of needed operations and time needed for the whole sorting process.
Cited by 0
Schwarz, Jakub · Brno University of Technology Digital Library (Brno University of Technology) · 2011
Pri obrovských objemech dat, které se behem výrobních procesu zpracovávají, je snadná orientace a hledání v nich zcela zásadní. Správné a rychlé trídení dat je jednou z nejduležitejších cinností pri jejich zpracování. Cílem této bakalárské práce je provést rešerši algoritmu trídení. K tomuto cíli budou vymezeny základní pojmy v oblasti trídení a popsáno rozdelení trídicích algoritmu podle ruzných kritérií. U každého z vybraných algoritmu vnitrního trídení polí bude analyzován princip trídení a proveden rozbor casové efektivnosti. Výsledky budou overeny experimentálním programem.
Cited by 0Open access
Abibou, Ramatou · Infoscience (Ecole Polytechnique Fédérale de Lausanne) · 2005
Implementation of a variety of sorting algorithms, and look at their behavior and running times on different inputs.
Cited by 0Open access
Akl, Selim G. · 1985
Parallel Sorting Algorithms explains how to use parallel algorithms to sort a sequence of items on a variety of parallel computers. The book reviews the sorting problem, the parallel models of computation, parallel algorithms, and the lower bounds on the parallel sorting problems. The text also presents twenty different algorithms, such as linear arrays, mesh-connected computers, cube-connected computers. Another example where algorithm can be applied is on the shared-memory SIMD (single instruction stream multiple data stream) computers in which the whole sequence to be sorted can fit in the
Cited by 16
Ryan H. Nelson · Defense Technical Information Center (DTIC) · 1963
Cited by 0
Sousa Pinto, Deriving Sorting, Algorithms José et al. · 2006
This paper shows how 3 well-known sorting algorithms can be derived by similar sequences of transformation steps from a common specification. Each derivation uses an auxiliary algorithm based on insertion into an intermediate structure. The proofs given involve both inductive and coinductive reasoning, which are here expressed in the same program calculation framework, based on unicity properties.
Cited by 0
José Bacelar Almeida, Jorge Sousa Pinto · ArXiv.org · 2008
This paper proposes new derivations of three well-known sorting algorithms, in their functional formulation. The approach we use is based on three main ingredients: first, the algorithms are derived from a simpler algorithm, i.e. the specification is already a solution to the problem (in this sense our derivations are program transformations). Secondly, a mixture of inductive and coinductive arguments are used in a uniform, algebraic style in our reasoning. Finally, the approach uses structural invariants so as to strengthen the equational reasoning with logical arguments that cannot be captured in the algebraic framework.
Cited by 1Open access
Belyi, E., Lapko, O. · Repository of Belarusian National Technical University (Belarusian National Technical University) · 2021
Cited by 0
Shynkarenko Viktor, Makarov Oleksii · International scientific and technical conference Information technologies in metallurgy and machine building · 2024
This study represents the usage of data preprocessing for performance improvement of sorting algorithms. Combining of different basic sorting algorithms was already successfully used to outperform any sole algorithm. The purpose of this research is to discover and estimate different ways to reorganize unsorted data just before executing the main sorting algorithm. Five preprocessing technics were developed and tested in combination with cocktail sort, insertion sort and quick sort. Time efficiency was estimated by comparing time of sole sorting algorithm and combined algorithm which includes preprocessing. Further studying of preprocessing methods and their impact on different sorting algorithms is required.
Cited by 0Open access
Jeff Edmonds · Cambridge University Press eBooks · 2024
Understand algorithms and their design with this revised student-friendly textbook. Unlike other algorithms books, this one is approachable, the methods it explains are straightforward, and the insights it provides are numerous and valuable. Without grinding through lots of formal proof, students will benefit from step-by-step methods for developing algorithms, expert guidance on common pitfalls, and an appreciation of the bigger picture. Revised and updated, this second edition includes a new chapter on machine learning algorithms, and concise key concept summaries at the end of each part for quick reference. Also new to this edition are more than 150 new exercises: selected solutions are included to let students check their progress, while a full solutions manual is available online for instructors. No other text explains complex topics such as loop invariants as clearly, helping students to think abstractly and preparing them for creating their own innovative ways to solve problems.
Cited by 0
Viktor Shynkarenko, А.Yu. Doroshenko, Olena Yatsenko et al. · PROBLEMS IN PROGRAMMING · 2022
he possibilities of improving sorting time parameters through preprocessing by stochastic sorting were investigated. The hypothesis that two-component stochastic + classical sorting outperforms classic one-component sorting in terms of time efficiency was experimentally confirmed. Sorting with different computational complexity is accepted as classical sorting algorithms: shaker sort- ing with computational complexity O(n2), insertions O(n2), Shell O(n·(log n)2) ... O(n3/2), fast with optimization of ending sequences O(n·log n). The greatest effect is obtained when performing comparisons using stochastic sorting in the amount of 160 percent of the array’s size. Indicators of the efficiency of the exchange of two elements, as well as series of exchanges, are introduced. This allowed to determine the highest efficiency of stochastic sorting (as the first component of two-component sorting), when one element for comparison is chosen from the first part of the array and the other from the second. For algorithms with a computational complexity of O(n2) the improvement in time efficiency reached 70–80 percent. However, for Shell sort and quick sort, the stochas- tic presort has no positive effect, but instead increases the total sorting time, which is apparently due to the initial high efficiency of these sorting methods. The hypothesis that three-component sorting fast + stochastic + insertions would increase sorting time efficiency was not confirmed. However, during the experiment, the recommended size of the array was determined, at which point the two-component quick + insertion sort must be switched to the second component – insertion sorting. The optimal length of the ending sequences is between 60 and 80 elements. Given that algorithm time efficiency is affected by computer architecture, operat- ing system, software development and execution environment, data types, data sizes, and their values, time efficiency indicators should be specified in each specific case.
Cited by 3Open access
Vamsi Kundeti, Sanguthevar Rajasekaran · Lecture notes in computer science · 2008
Cited by 2