``py def partisionan(saringan, low, high): pivot = array[high] i = low - 1 pikeun j di range(low, high): lamun array[j] <= pivot: i = i + 1 (array[i], array[j]) = (array[j], array[i] (array[i + 1], array[high]) = (array[high], array[i + 1]) balik i + 1 def quickSorting(array, low, high): lamun low < high: pi = partisionan, low, high) quickSorting(array, low, pi - 1) quickSorting, pi + 1, high) ```
spam fails_task lang_mismatch pii not_appropriate hate_speech sexual_content quality toxicity humor helpfulness creativity violence