Skip to content

A small experiment algorithm. Works like a hybrid (QuickSort and InsertionSort) sorting algorithm, only difference being it splits main array into sub arrays based on the number of processors the device has, or how many it needs.

Notifications You must be signed in to change notification settings

45i/ParallellisedSorter

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

44 Commits
 
 
 
 
 
 

Repository files navigation

ParallellisedSorter

A small experiment to make a hybrid (QuickSort and InsertionSort) sort algorithm that sorts an array in parallel, ie, in multiple threads.

Some Results

"I think they're called benchmarks"

Number Of Elements Time Taken
10 3ms
100 6ms
10,000 41ms
100,000 2s 455ms

Hardware Details

  • Processor :- Intel i3-6006U CPU @ 2.00 GHz
  • RAM :- 12GB -> Free: 11.9GB

Values are all generated randomly

Execution Speeds vary from device to device

Example Text Files are included here

About

A small experiment algorithm. Works like a hybrid (QuickSort and InsertionSort) sorting algorithm, only difference being it splits main array into sub arrays based on the number of processors the device has, or how many it needs.

Topics

Resources

Stars

Watchers

Forks

Packages

No packages published

Languages