Skip to content

Selection algorithm using quicksort partitioning

Notifications You must be signed in to change notification settings

chasestarr/selection

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

1 Commit
 
 
 
 
 
 

Repository files navigation

GoDoc

import (
  "fmt"

  "github.com/chasestarr/selection"
)

func main() {
  input := []int{3, 8, 2, 5, 1, 4, 7, 6}
  // returns the ith smallest array element
  s := selection.Select(input, 4)
  fmt.Println(s) // 4
}

About

Selection algorithm using quicksort partitioning

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages