# gosort

**Repository Path**: mirrors_karrick/gosort

## Basic Information

- **Project Name**: gosort
- **Description**: sorting algorithms expressed in Go
- **Primary Language**: Unknown
- **License**: MIT
- **Default Branch**: master
- **Homepage**: None
- **GVP Project**: No

## Statistics

- **Stars**: 0
- **Forks**: 0
- **Created**: 2020-08-09
- **Last Updated**: 2026-03-21

## Categories & Tags

**Categories**: Uncategorized

**Tags**: None

## README

# gosort

sorting algorithms expressed in Go

## Observations

At 10 integers, insertion sort (2) is most efficient.

At 100 integers, insertion sort (3) is most efficient.

Somewhere between 1k and 10k integers, depending on the architecture
and OS, heap sort is more efficient than insertion sort (3).