Implement Quicksort

Description

Implement a nada program that computes Quicksort on an inputted array of SecretIntgers

Use Case

This is a commonly used math function, and thus we should have an example for others to use rather than write the nada program from scratch.

Specific Requirements

The nada program should have one party, whose input is an array of SecretIntegers and output the sorted array

DIM = 10

def nada_main():
    party1 = Party(name="Party1")

    num = na.array([DIM], party1, "num", SecretInteger)

    # implement quick sort

    return na.output(output_array, party1, "sorted_array")

Protocol