Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

hamzamemon/SerialParallelAlgorithms

Open more actions menu

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

22 Commits
22 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Serial vs Parallel Algorithms

This project compares the serial versions of CountingSort, MergeSort and QuickSort to their parallel versions and outputs the runtime results.

Findings

CountingSort

  • Arrays at smaller sizes performed better in the serial version
  • Arrays at higher sizes performed significantly better in the parallel version

MergeSort

  • Arrays at smaller sizes performed about the same in both versions
  • Arrays at higher sizes performed significantly better in the parallel version

QuickSort

  • Arrays at smaller sizes performed about the same in both versions
  • Arrays at higher sizes performed better in the parallel version

alt text

About

No description, website, or topics provided.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

 
 
 

Contributors

Languages

Morty Proxy This is a proxified and sanitized view of the page, visit original site.