<s>[INST] This problem is the reverse of the previous one. You take a list of integers $A$ and you are supposed to return the maximum number that only uses some of the elements of $A$, with the possibility of having leading zeroes.
 
Example: Given the list $A=[1,4,2,8,6]$, it would be possible to return 8642. 
 
However, I want to do this using a sorting algorithm. As a sorting algorithm I'd like to use Quicksort.
 
Let's implement it first, then we can figure out what we can do with it.
 
Implementation from: https://www.geeksforgeeks.org/quick-sort/, with slight adjustments (l bits swapper to append).
 
Here's the image of code we will be using:
 
 algorithm index 0
 left 0 right length of list 
 swap any two things 
 then sort recursively left right - 1 
 until everything is ok
 
 these partitions: [5,2,9,1,7]
 which are the out put of the pivot quick sorta 
 [4,1,2,5,9,7], [4,1,7,5,2,9] etc.
 
 Here is the in implementation explained above, we'll swap() function
 
 The recursive() function will implement quicklisr()
 
 ```python
 class Solution:
     def swap(self, A, i, j):
         A[i], A[j] = A[j], A[i]
 
     def recursive(self, A, left, right):
         if left < right:
             piv = self.partition(A, left, right)
             self.recursive(A, left, piv - 1)
             self.recursive(A, piv + 1, right)
 
     def partition(self, A, left, right):
         piv = A[right]
         leftwall = left
 
         for i in range(left, right):
             if A[i] >= piv:
                 self.swap(A, i, leftwall)
                 leftwall += 1
 
         self.swap(A, right, leftwall)
 
         return leftwall
 
     def quickSort(self, A):
         n = len(A)
         self.recursive(A, 0, n - 1)
         return A
 
     def largestNumber(self, nums):
         nums = map(str, nums)
         nums = self.quickSort(list(nums))
         largest_number = ''.join(nums)
 
         return '0' if largest_number[0] == '0' else largest_number
```
 
How to arrange smaller numbers in the greater value using an explanation that doesn't require knowing much about QuickSort?[/INST]