Essays about: "Merge sort"

Showing result 1 - 5 of 10 essays containing the words Merge sort.

  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. Performance evaluation for choosing between Rust and C++

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

    Author : Patrik Karlsson; [2023]
    Keywords : C ; Rust; evaluation;

    Abstract : Developers face numerous challenges in their careers, including the critical decision of choosing the most suitable programming language to tackle these challenges. Each programming language presents its unique set of advantages and disadvantages, making the decision-making process complex. READ MORE

  4. 3. Resource-efficient and fast Point-in-Time joins for Apache Spark : Optimization of time travel operations for the creation of machine learning training datasets

    University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Author : Axel Pettersson; [2022]
    Keywords : Apache Spark; Point-in-Time; ASOF; Join; Optimizations; Time travel; Apache Spark; Point-in-Time; ASOF; Join; Optimeringar; Tidsresning;

    Abstract : A scenario in which modern machine learning models are trained is to make use of past data to be able to make predictions about the future. When working with multiple structured and time-labeled datasets, it has become a more common practice to make use of a join operator called the Point-in-Time join, or PIT join, to construct these datasets. READ MORE

  5. 4. 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

  6. 5. Exploring the application of neural networks in predictions of nuclear binding energies

    University essay from Lunds universitet/Matematisk fysik; Lunds universitet/Fysiska institutionen

    Author : Martin Waites; [2020]
    Keywords : neural networks; drip-line; nuclear physics; binding energy; exotic nuclei; Hartree-Fock-Bogolyubov; Physics and Astronomy;

    Abstract : In this project the locations of the proton and neutron drip-lines are predicted using neural networks and theoretical data obtained by applying the HFBTHO program. For each of the neural networks a comparison is made between neural network predictions and experimental data in the region experimental data exists. READ MORE