Why Go
- Case Studies
  
  Common problems companies solve with Go
- Use Cases
  
  Stories about how and why companies use Go
- Security
  
  How Go can help keep you secure by default
Learn
Docs
- Effective Go
  
  Tips for writing clear, performant, and idiomatic Go code
- Go User Manual
  
  A complete introduction to building software with Go
- Standard library
  
  Reference documentation for Go's standard library
- Release Notes
  
  Learn what's new in each Go release
Packages
Community
- Recorded Talks
  
  Videos from prior events
- Meetups
  
  Meet other local Go developers
- Conferences
  
  Learn and network with Go developers from around the world
- Go blog
  
  The Go project's official blog.
- Go project
  
  Get help and stay informed from Go
- Get connected

heap

package

v0.1.5 Latest Latest Go to latest Published: Feb 11, 2025 License: MIT-0 Imports: 1 Imported by: 0

Details

Valid go.mod file
Redistributable license
Tagged version
Stable version
Learn more about best practices

Repository

github.com/ncruces/sort

Links

Open Source Insights

Documentation ¶

Overview ¶

Package heap implements Floyd's bottom-up Heapsort.

Index ¶

func Sort[T cmp.Ordered](s []T)

Constants ¶

This section is empty.

Variables ¶

This section is empty.

Functions ¶

func Sort ¶

func Sort[T cmp.Ordered](s []T)

Sort uses the Heapsort algorithm to sort a slice. It uses O(n·log(n)) time and O(1) space.

Types ¶

This section is empty.

Source Files ¶

View all Source files

heap.go