Here's a Python implementation of the Bubble Sort Technique for sorting a list of numbers in ascending order:
def BSORT(arr):
n = len(arr)
# Traverse through all array elements
for i in range(n):
# Last i elements are already sorted
for j in range(0, n-i-1):
# Traverse the array from 0 to n-i-1
# Swap if the element found is greater
# than the next element
if arr[j] > arr[j+1] :
arr[j], arr[j+1] = arr[j+1], arr[j]
return arr
In this implementation, we have used two nested loops to traverse the array and compare adjacent elements. In each pass, we compare each pair of adjacent elements and swap them if they are not in the correct order. By the end of each pass, the largest element will have "bubbled" up to the end of the array. We repeat this process until the entire array is sorted.
To use this function, you can simply call it and pass in your list of numbers as an argument. For example:
arr = [64, 34, 25, 12, 22, 11, 90]
sorted_arr = BSORT(arr)
print(sorted_arr)
This will output: [11, 12, 22, 25, 34, 64, 90], which is the sorted version of the input list.