https://github.com/willbarkoff/temporalsort

🔢 O(n) sorting algorithm for golang
https://github.com/willbarkoff/temporalsort

Last synced: 4 months ago
JSON representation

🔢 O(n) sorting algorithm for golang

• Host: GitHub
• URL: https://github.com/willbarkoff/temporalsort
• Owner: willbarkoff
• License: mit
• Created: 2021-09-27T22:07:09.000Z (over 4 years ago)
• Default Branch: master
• Last Pushed: 2021-09-27T22:16:52.000Z (over 4 years ago)
• Last Synced: 2024-06-20T00:40:47.871Z (almost 2 years ago)
• Language: Go
• Homepage: https://pkg.go.dev/github.com/willbarkoff/temporalsort
• Size: 5.86 KB
• Stars: 0
• Watchers: 2
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE.md

Awesome Lists containing this project

README

          
# TemporalSort

[![Go Reference](https://pkg.go.dev/badge/github.com/willbarkoff/temporalsort.svg)](https://pkg.go.dev/github.com/willbarkoff/temporalsort)

[![Test](https://github.com/willbarkoff/temporalsort/actions/workflows/test.yml/badge.svg)](https://github.com/willbarkoff/temporalsort/actions/workflows/test.yml)

The sorting algorithm of the future. Runs in O(n) time (best, average, and worst case) using principles from physics and the linearity of time.

This module defines one function `Sort([]int)`. It returns a sorted version of the list. Note that negative numbers are currently not supported.