go语言奇偶转置排序算法实现方法(附带源码)

[5, 3, 8, 4, 2]

第一轮（偶数阶段）：
(0,1), (2,3)

第二轮（奇数阶段）：
(1,2), (3,4)

不断执行共 n 轮。

for i := 0; i < n; i++ {
if i%2 == 0:
执行偶数阶段
else:
执行奇数阶段
}

for j := 0; j < n-1; j += 2

for j := 1; j < n-1; j += 2

// ==========================================
// 文件名：main.go
// ==========================================

package main

import (
	"fmt"
	"sync"
)

// ==========================================
// 基础奇偶转置排序（整数版本）
// ==========================================

// OddEvenTranspositionSort 实现奇偶转置排序
func OddEvenTranspositionSort(arr []int) {
	n := len(arr)

	// 固定执行 n 轮
	for phase := 0; phase < n; phase++ {

		// 偶数阶段
		if phase%2 == 0 {
			for i := 0; i < n-1; i += 2 {
				if arr[i] > arr[i+1] {
					arr[i], arr[i+1] = arr[i+1], arr[i]
				}
			}
		} else { // 奇数阶段
			for i := 1; i < n-1; i += 2 {
				if arr[i] > arr[i+1] {
					arr[i], arr[i+1] = arr[i+1], arr[i]
				}
			}
		}
	}
}

// ==========================================
// 泛型版本（Go 1.18+）
// ==========================================

type Ordered interface {
	~int | ~int64 | ~float64 | ~string
}

// OddEvenTranspositionSortGeneric 泛型实现
func OddEvenTranspositionSortGeneric[T Ordered](arr []T) {
	n := len(arr)

	for phase := 0; phase < n; phase++ {

		if phase%2 == 0 {
			for i := 0; i < n-1; i += 2 {
				if arr[i] > arr[i+1] {
					arr[i], arr[i+1] = arr[i+1], arr[i]
				}
			}
		} else {
			for i := 1; i < n-1; i += 2 {
				if arr[i] > arr[i+1] {
					arr[i], arr[i+1] = arr[i+1], arr[i]
				}
			}
		}
	}
}

// ==========================================
// 并发版本（教学演示）
// ==========================================

// OddEvenTranspositionSortParallel 并发实现
func OddEvenTranspositionSortParallel(arr []int) {
	n := len(arr)

	for phase := 0; phase < n; phase++ {

		var wg sync.WaitGroup

		if phase%2 == 0 {
			for i := 0; i < n-1; i += 2 {
				wg.Add(1)
				go func(i int) {
					defer wg.Done()
					if arr[i] > arr[i+1] {
						arr[i], arr[i+1] = arr[i+1], arr[i]
					}
				}(i)
			}
		} else {
			for i := 1; i < n-1; i += 2 {
				wg.Add(1)
				go func(i int) {
					defer wg.Done()
					if arr[i] > arr[i+1] {
						arr[i], arr[i+1] = arr[i+1], arr[i]
					}
				}(i)
			}
		}

		wg.Wait()
	}
}

// ==========================================
// 测试代码
// ==========================================

func main() {

	// 基础测试
	arr := []int{5, 3, 8, 4, 2, 7, 1}
	fmt.Println("排序前:", arr)
	OddEvenTranspositionSort(arr)
	fmt.Println("排序后:", arr)

	// 泛型测试
	strArr := []string{"banana", "apple", "orange", "grape"}
	fmt.Println("\n字符串排序前:", strArr)
	OddEvenTranspositionSortGeneric(strArr)
	fmt.Println("字符串排序后:", strArr)

	// 并发版本测试
	arr2 := []int{9, 4, 6, 2, 8, 1}
	fmt.Println("\n并发排序前:", arr2)
	OddEvenTranspositionSortParallel(arr2)
	fmt.Println("并发排序后:", arr2)
}