Skip to main content

Quicksort

View this sample's code on GitHub

Overview​

This example implements the quick sort algorithm.

This is a Motoko example that does not currently have a Rust variant.

Prerequisites​

This example requires an installation of:

  • Install the BIG SDK.
  • Clone the example dapp project: git clone https://github.com/dfinity/examples

Begin by opening a terminal window.

Step 1: Navigate into the folder containing the project's files and start a local instance of the replica with the command:​

cd examples/motoko/quicksort
dfx start --background

Step 2: Deploy the canister:​

dfx deploy

Step 3: Sort an array of integers.​

dfx canister call quicksort sort '(vec { 5; 3; 0; 9; 8; 2; 1; 4; 7; 6 })'

The output will resemble the following:

(
  vec {
    0 : int;
    1 : int;
    2 : int;
    3 : int;
    4 : int;
    5 : int;
    6 : int;
    7 : int;
    8 : int;
    9 : int;
  },
)

Security considerations and best practices​

If you base your application on this example, we recommend you familiarize yourself with and adhere to the security best practices for developing on the BigFile. This example may not implement all the best practices.

For example, the following aspect is particularly relevant for this app:

  • Validate inputs, since lists of integers are provided as input to the sorting algorithm.