Archives/go-algorithms
2
0
Fork 0
mirror of https://github.com/0xAX/go-algorithms synced 2024-11-13 13:10:30 +00:00
Code Issues Projects Releases Wiki Activity

Merge pull request #12 from srksumanth/sumanth

Browse Source 
Improve loop syntax and format code
This commit is contained in:
0xAX 2018-03-26 20:31:37 +02:00 committed by GitHub
commit 741916f31c
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 30 additions and 30 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

60
sorting/cocktail_sort.go
View File

@ -9,35 +9,35 @@ import "fmt"
import "github.com/0xAX/go-algorithms"
func main() {
arr := utils.RandArray(10)
fmt.Println("Initial array is:", arr)
fmt.Println("")
tmp := 0
for i := 0; i < len(arr) / 2; i++ {
left := 0
right := len(arr) - 1
for ; left <= right ; {
if arr[left] > arr[left + 1] {
tmp = arr[left]
arr[left] = arr[left + 1]
arr[left + 1] = tmp
}
left++
if arr[right - 1] > arr[right] {
tmp = arr[right - 1]
arr[right - 1] = arr[right]
arr[right] = tmp
}
arr := utils.RandArray(10)
fmt.Println("Initial array is:", arr)
fmt.Println("")
right--
}
}
fmt.Println("Sorted array is: ", arr)
tmp := 0
for i := 0; i < len(arr)/2; i++ {
left := 0
right := len(arr) - 1
for left <= right {
if arr[left] > arr[left+1] {
tmp = arr[left]
arr[left] = arr[left+1]
arr[left+1] = tmp
}
left++
if arr[right-1] > arr[right] {
tmp = arr[right-1]
arr[right-1] = arr[right]
arr[right] = tmp
}
right--
}
}
fmt.Println("Sorted array is: ", arr)
}