Essays about: "Quicksort"

Showing result 1 - 5 of 8 essays containing the word Quicksort.

  1. 1. A dynamic approach to sorting with respect to big data

    University essay from Umeå universitet/Institutionen för datavetenskap

    Author : Filip Almström; [2023]
    Keywords : DynamicSort; sorting; dynamic; big data; comparing; characteristics; run-time;

    Abstract : This study introduces a dynamic approach to sorting, making use of predictions and data gathered during run-time to optimize the sorting of the current data set. This approach is used to develop a sorting algorithm called DynamicSort which partitions data and calculates a partial standard deviation for each partition to determine which of two sorting algorithms should be used to sort the partition. READ MORE

  3. 2. A study about differences in performance with parallel and sequential sorting algorithms

    University essay from Blekinge Tekniska Högskola/Institutionen för programvaruteknik

    Author : Joel Nyholm; [2021]
    Keywords : Sorting algorithms; Operating systems; Parallelism; Performance;

    Abstract : Background: Sorting algorithms are an essential part of computer science. With the use of parallelism, these algorithms performance can improve. Objectives: To assess parallel sorting algorithms performance compared with their sequential counterparts and see what contextual factors make a difference in performance. READ MORE

  4. 3. A study of the effects of different contextual variables on sorting algorithms

    University essay from Blekinge Tekniska Högskola/Institutionen för programvaruteknik

    Author : Casper Björk; [2020]
    Keywords : Sorting algorithms; Performance; Implementation languages; Data types; Sorterings algorithmer; Prestandard; Programmeringsspråk; Data typer;

    Abstract : Background: Computers use sorting algorithms to prepare data for search or insert operations, these operations can be a bottleneck for performance. Objectives: To evaluate sorting algorithms performances when existing in different implementation environments like different languages, sorting in different data types and in different sizes. READ MORE

  5. 4. Performance comparison of Java and C++ when sorting integers and writing/reading files.

    University essay from Blekinge Tekniska Högskola/Institutionen för datavetenskap

    Author : Suraj Sharma; [2019]
    Keywords : Programming; software; java; c ; performance;

    Abstract : This study is conducted to show the strengths and weaknesses of C++ and Java in three areas that are used often in programming; loading, sorting and saving data.Performance and scalability are large factors in software development and choosing the right programming language is often a long process. READ MORE

  6. 5. Examining Sorting Algorithm Performance Under System Load

    University essay from KTH/Skolan för datavetenskap och kommunikation (CSC)

    Author : Niklas Hamrin; Nils Runebjörk; [2017]
    Keywords : ;

    Abstract : In this thesis, we conducted tests in order to determine how system load affected the speed of commonly used algorithms. The difficulty of obtaining these type of results theoretically due to a large number of factors that can affect performance motivated the use of simulation. READ MORE