使用我制作的一个类进行排序，其中数据以列表形式存储

from typing import List

class Sorter:
    def __init__(self, data: List[int]):
        self.data = data

    def bubble_sort(self) -> List[int]:
        n = len(self.data)
        for i in range(n):
            for j in range(0, n-i-1):
                if self.data[j] > self.data[j+1]:
                    self.data[j], self.data[j+1] = self.data[j+1], self.data[j]
        return self.data

    def selection_sort(self) -> List[int]:
        n = len(self.data)
        for i in range(n):
            min_idx = i
            for j in range(i+1, n):
                if self.data[j] < self.data[min_idx]:
                    min_idx = j
            self.data[i], self.data[min_idx] = self.data[min_idx], self.data[i]
        return self.data

    def insertion_sort(self) -> List[int]:
        n = len(self.data)
        for i in range(1, n):
            key = self.data[i]
            j = i - 1
            while j >= 0 and self.data[j] > key:
                self.data[j+1] = self.data[j]
                j -= 1
            self.data[j+1] = key
        return self.data

    def quick_sort(self) -> List[int]:
        def partition(low, high):
            i = low - 1
            pivot = self.data[high]
            for j in range(low, high):
                if self.data[j] < pivot:
                    i += 1
                    self.data[i], self.data[j] = self.data[j], self.data[i]
            self.data[i+1], self.data[high] = self.data[high], self.data[i+1]
            return i + 1

        def quick_sort_helper(low, high):
            if low < high:
                pi = partition(low, high)
                quick_sort_helper(low, pi - 1)
                quick_sort_helper(pi + 1, high)

        quick_sort_helper(0, len(self.data) - 1)
        return self.data

# 示例用法
data = [5, 2, 8, 1, 9]
sorter = Sorter(data)
sorted_data = sorter.bubble_sort()
print(sorted_data)