forked from 0xAX/go-algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
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
0xAX
committed
Jun 25, 2014
1 parent
b83ebc6
commit ca7cee2
Showing
3 changed files
with
52 additions
and
1 deletion.
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
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 |
---|---|---|
|
@@ -22,6 +22,7 @@ alghoritms | |
* merge sort | ||
* cocktail sort | ||
* gnome sort | ||
* quick sort | ||
|
||
contribution | ||
------------ | ||
|
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,49 @@ | ||
package main | ||
|
||
/* | ||
* Quick sort - https://en.wikipedia.org/wiki/Quicksort | ||
*/ | ||
|
||
import "fmt" | ||
import "math/rand" | ||
|
||
import "github.com/0xAX/go-algorithms" | ||
|
||
func quick_sort(arr []int) []int { | ||
|
||
if len(arr) <= 1 { | ||
return arr | ||
} | ||
|
||
median := arr[rand.Intn(len(arr))] | ||
|
||
low_part := make([]int, 0, len(arr)) | ||
high_part := make([]int, 0, len(arr)) | ||
middle_part := make([]int, 0, len(arr)) | ||
|
||
for _, item := range arr { | ||
switch { | ||
case item < median: | ||
low_part = append(low_part, item) | ||
case item == median: | ||
middle_part = append(middle_part, item) | ||
case item > median: | ||
high_part = append(high_part, item) | ||
} | ||
} | ||
|
||
low_part = quick_sort(low_part) | ||
high_part = quick_sort(high_part) | ||
|
||
low_part = append(low_part, middle_part...) | ||
low_part = append(low_part, high_part...) | ||
|
||
return low_part | ||
} | ||
|
||
func main() { | ||
arr := utils.RandArray(10) | ||
fmt.Println("Initial array is:", arr) | ||
fmt.Println("") | ||
fmt.Println("Sorted array is: ", quick_sort(arr)) | ||
} |