Sökning: "Merge sort"

Visar resultat 1 - 5 av 13 uppsatser innehållade orden Merge sort.

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

    Master-uppsats, Umeå universitet/Institutionen för datavetenskap

    Författare :Filip Almström; [2023]
    Nyckelord :DynamicSort; sorting; dynamic; big data; comparing; characteristics; run-time;

    Sammanfattning : 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. LÄS MER

  3. 2. Performance evaluation for choosing between Rust and C++

    Kandidat-uppsats, Blekinge Tekniska Högskola/Institutionen för programvaruteknik

    Författare :Patrik Karlsson; [2023]
    Nyckelord :C ; Rust; evaluation;

    Sammanfattning : 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. LÄS MER

  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

    Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Författare :Axel Pettersson; [2022]
    Nyckelord :Apache Spark; Point-in-Time; ASOF; Join; Optimizations; Time travel; Apache Spark; Point-in-Time; ASOF; Join; Optimeringar; Tidsresning;

    Sammanfattning : 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. LÄS MER

  5. 4. Livet efter Schrems II : EU:s integritetsskydd i ljuset av statlig övervakning

    Uppsats för yrkesexamina på grundnivå, Stockholms universitet/Juridiska institutionen

    Författare :Mattias Olsson; [2021]
    Nyckelord :GDPR; Schrems; International transfers; privacy; Facebook; GDPR; Schrems; tredjelandsöverföring; integritet; Facebook;

    Sammanfattning : International transfers of personal data impose great risk to the fundamental rights of individuals. Equally true however is the fact that international transfers of personal data (as well as other categories of data) are of great value to the global economy and to the business of many European companies. LÄS MER

  7. 5. A study about differences in performance with parallel and sequential sorting algorithms

    Kandidat-uppsats, Blekinge Tekniska Högskola/Institutionen för programvaruteknik

    Författare :Joel Nyholm; [2021]
    Nyckelord :Sorting algorithms; Operating systems; Parallelism; Performance;

    Sammanfattning : 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. LÄS MER