NillionNetwork/nada-by-example

Implement Quicksort

Open

#12 opened on Aug 13, 2024

View on GitHubContributor guide
 (2 comments) (0 reactions) (0 assignees)Python (10 forks)auto 404
enhancementgood first issuehacktoberfesthelp wanted

Repository metrics

Stars
 (11 stars)
PR merge metrics
 (PR metrics pending)

Description

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

Contributor guide

Research direction
Study the Nada programming model and API by reviewing existing examples in the repository. Then, implement the quicksort algorithm using Nada's array operations and SecretInteger type.
Tech stack
python
Domain
backend
Issue type
Feature
DifficultyEstimated implementation difficulty for a new contributor, from 1 for very small changes to 5 for expert-level work.
2
Estimated timeA rough time range for an experienced contributor to investigate, implement, test, and prepare a pull request.
1-3 hours
Activity statusHow available the issue appears right now: fresh, active, stale, blocked, or waiting on maintainer input.
Fresh
ClarityHow clearly the issue explains the expected change, acceptance criteria, and next step.
Clear
Prerequisites
Python
Newbie friendlinessA 1-100 score estimating how approachable this issue is for first-time contributors.
75