https://github.com/akshat120/go_sorting

Go Sorting Algorithm Benchmark
https://github.com/akshat120/go_sorting

algotithms golang goroutine waitgroup

Last synced: 12 months ago
JSON representation

Go Sorting Algorithm Benchmark

• Host: GitHub
• URL: https://github.com/akshat120/go_sorting
• Owner: Akshat120
• Created: 2025-03-11T09:51:46.000Z (over 1 year ago)
• Default Branch: main
• Last Pushed: 2025-03-11T13:11:55.000Z (over 1 year ago)
• Last Synced: 2025-03-24T00:58:12.218Z (over 1 year ago)
• Topics: algotithms, golang, goroutine, waitgroup
• Language: Go
• Homepage:
• Size: 10.7 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: readme.md

Awesome Lists containing this project

README

          
# Go Sorting Algorithm Benchmark

This is a Go program that benchmarks different sorting algorithms by measuring their execution time on a randomly generated array of integers. The program uses goroutines and WaitGroups to run multiple sorting algorithms concurrently.

## Features

- Benchmarks four sorting algorithms:

  - Bubble Sort

  - Insertion Sort

  - Selection Sort

  - Merge Sort

  - Quick Sort

- Runs algorithms concurrently using goroutines

- Measures and displays execution time for each algorithm

- Uses a randomly generated array of 100,000 integers

## Specifications for testing machine

- **Chip**: Apple M4  

- **CPU**: 10-core (6 performance cores, 4 efficiency cores)  

- **GPU**: 10-core  

- **Memory**: 16GB

## Output for testing machine