optimized swap in bubble sort

modifiedswap.go

func pass(list []int, ascending bool) int {
	var N int = len(list)
	var swapCount int

	for i := 0; i < N-1; i++ {
		var firstElement int = list[i]
		var secondElement int = list[i+1]

		if ascending == true {
			if firstElement > secondElement {
				swap(list, i)
				swapCount++
			}
		} else {
			if firstElement < secondElement {
				swap(list, i)
				swapCount++
			}
		}

	}

	return swapCount
}