dongzhong2018
2017-09-03 16:52
浏览 162
已采纳

Hoare的分区方案golang

Quicksort with Hoare's partitioning

// Hoare's partitioning scheme
func PartitionHoare(arr []int, low, high int) int {
    length := len(arr)

    if length == 0 {
        panic("Array size is 0")
    }

    pivot := arr[low]
    i := low - 1
    j := high + 1

    for {
        for {
            j--
            if arr[j] > pivot {
                break
            }
        }

        for {
            i++
            if arr[i] < pivot {
                break
            }
        }

        if i < j {
            Swap(&arr, i, j)
        } else {
            return j
        }
    }
}

// Sort
func SortHoare(arr []int, low, high int) {
    if low < high {
        p := PartitionHoare(arr, low, high)
        SortHoare(arr, low, p)
        SortHoare(arr, p+1, high)
    }
}


// Swap i <--> j
func Swap(arr *[]int, i, j int) {
    (*arr)[i], (*arr)[j] = (*arr)[j], (*arr)[i]
}

Trying to implement Quicksort using Hoare's partitioning but can't figure out what am I doing wrong. It is stuck in an infinite loop, always runs out of memory

fatal error: runtime: out of memory
  • 写回答
  • 好问题 提建议
  • 追加酬金
  • 关注问题
  • 邀请回答

1条回答 默认 最新

相关推荐 更多相似问题