def quicksort(arr):
    if len(arr) <= 1:
        return arr
    else:
        pivot = arr[0]
        less = [x for x in arr[1:] if x <= pivot]
        greater = [x for x in arr[1:] if x > pivot]
        return quicksort(less) + [pivot] + quicksort(greater)

# Example usage:
arr = [10, 5, 2, 3, 7, 9, 1, 8]
sorted_arr = quicksort(arr)
print(sorted_arr)