Here's a Python function to sort a list of integers using the bubble sort algorithm:

def bubble_sort(arr):
    n = len(arr)
    for i in range(n):
        for j in range(0, n - i - 1):
            if arr[j] > arr[j + 1]:
                arr[j], arr[j + 1] = arr[j + 1], arr[j]
    return arr

The function takes a list arr as input and sorts it in-place (i.e., the input list is modified by the function). The outer loop iterates n times, where n is the length of the list. The inner loop iterates over the elements of the list, comparing each pair of adjacent elements and swapping them if they are in the wrong order.

This algorithm has a time complexity of O(n^2), which means that it takes quadratic time in the worst case. This makes it suitable for small lists, but not very efficient for large lists.
spam fails_task lang_mismatch pii not_appropriate hate_speech sexual_content quality toxicity humor helpfulness creativity violence