-
Notifications
You must be signed in to change notification settings - Fork 1k
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
ashishkrishan1995
committed
Oct 6, 2018
1 parent
e5da508
commit 2d7e5ef
Showing
1 changed file
with
40 additions
and
0 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,40 @@ | ||
// Selection Sort in Golang | ||
package main | ||
|
||
import ( | ||
"fmt" | ||
"math/rand" | ||
"time" | ||
) | ||
|
||
func main() { | ||
|
||
slice := generateSlice(20) | ||
fmt.Println("\n--- Unsorted --- \n\n", slice) | ||
selectionsort(slice) | ||
fmt.Println("\n--- Sorted ---\n\n", slice, "\n") | ||
} | ||
|
||
// Generates a slice of size, size filled with random numbers | ||
func generateSlice(size int) []int { | ||
|
||
slice := make([]int, size, size) | ||
rand.Seed(time.Now().UnixNano()) | ||
for i := 0; i < size; i++ { | ||
slice[i] = rand.Intn(999) - rand.Intn(999) | ||
} | ||
return slice | ||
} | ||
|
||
func selectionsort(items []int) { | ||
var n = len(items) | ||
for i := 0; i < n; i++ { | ||
var minIdx = i | ||
for j := i; j < n; j++ { | ||
if items[j] < items[minIdx] { | ||
minIdx = j | ||
} | ||
} | ||
items[i], items[minIdx] = items[minIdx], items[i] | ||
} | ||
} |