Golang策略模式实现算法动态切换

type Strategy interface {
    Execute(data []int) []int
}

type BubbleSort struct{}

func (b *BubbleSort) Execute(data []int) []int {
    // 简化冒泡排序实现
    sorted := make([]int, len(data))
    copy(sorted, data)
    for i := 0; i  sorted[j+1] {
                sorted[j], sorted[j+1] = sorted[j+1], sorted[j]
            }
        }
    }
    return sorted
}

type QuickSort struct{}

func (q *QuickSort) Execute(data []int) []int {
    // 快速排序实现（简化递归版本）
    if len(data) 

type Context struct {
    strategy Strategy
}

func (c *Context) SetStrategy(s Strategy) {
    c.strategy = s
}

func (c *Context) ExecuteStrategy(data []int) []int {
    if c.strategy == nil {
        panic("未设置策略")
    }
    return c.strategy.Execute(data)
}

ctx := &Context{}

// 使用冒泡排序
ctx.SetStrategy(&BubbleSort{})
result1 := ctx.ExecuteStrategy([]int{3, 1, 4, 1, 5})
fmt.Println("冒泡排序:", result1)

// 切换为快速排序
ctx.SetStrategy(&QuickSort{})
result2 := ctx.ExecuteStrategy([]int{3, 1, 4, 1, 5})
fmt.Println("快速排序:", result2)