We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Sorting
  4. Quicksort 1 - Partition
  5. Discussions

Quicksort 1 - Partition

  • controldenied1
     + 0 comments

    python3:

        left = []
right = []
equal = [arr[0]]
for i in range(1,len(arr)):
    if arr[i] > arr[0]:
        right.append(arr[i])
    else:
        left.append(arr[i])
x = left + equal + right
return x