Golang如何使用策略模式动态切换算法_Golang Strategy模式应用方法

type BubbleSort struct{}
<p>func (b *BubbleSort) Sort(data []int) []int {
n := len(data)
sorted := make([]int, n)
copy(sorted, data)
for i := 0; i < n-1; i++ {
for j := 0; j < n-i-1; j++ {
if sorted[j] > sorted[j+1] {
sorted[j], sorted[j+1] = sorted[j+1], sorted[j]
}
}
}
return sorted
}</p><p>type QuickSort struct{}</p><p>func (q *QuickSort) Sort(data []int) []int {
if len(data) <= 1 {
return data
}
sorted := make([]int, len(data))
copy(sorted, data)
quickSortHelper(sorted, 0, len(sorted)-1)
return sorted
}</p><p>func quickSortHelper(arr []int, low, high int) {
if low < high {
pi := partition(arr, low, high)
quickSortHelper(arr, low, pi-1)
quickSortHelper(arr, pi+1, high)
}
}</p><p>func partition(arr []int, low, high int) int {
pivot := arr[high]
i := low - 1
for j := low; j < high; j++ {
if arr[j] <= pivot {
i++
arr[i], arr[j] = arr[j], arr[i]
}
}
arr[i+1], arr[high] = arr[high], arr[i+1]
return i + 1
}

type Sorter struct {
    strategy SortStrategy
}
<p>func (s *Sorter) SetStrategy(strategy SortStrategy) {
s.strategy = strategy
}</p><p>func (s *Sorter) ExecuteSort(data []int) []int {
if s.strategy == nil {
panic("no strategy set")
}
return s.strategy.Sort(data)
}

func main() {
    data := []int{64, 34, 25, 12, 22, 11, 90}
<pre class="brush:php;toolbar:false;"><pre class="brush:php;toolbar:false;">sorter := &Sorter{}

// 使用冒泡排序
sorter.SetStrategy(&BubbleSort{})
result1 := sorter.ExecuteSort(data)
fmt.Println("Bubble Sort:", result1)

// 切换为快速排序
sorter.SetStrategy(&QuickSort{})
result2 := sorter.ExecuteSort(data)
fmt.Println("Quick Sort:", result2)