Quick sort in scheme

$10 USD

Ditutup

Dibuat

lebih dari 6 tahun yang lalu

$10 USD

Dibayar ketika dikirim

1. Define a recursive function in Scheme that implements quick sort, which can be specified by the following two rules. a) The empty list is already sorted. b) Non-empty lists can be sorted by sorting the tail values ≤ the head, sorting the tail values > the head, and then appending the resulting list on the either side of the head values.

Algorithm

Scheme

ID Proyek: 15828041

Tentang proyek

4 proposal

Proyek remot

Aktif 6 tahun yang lalu

Ingin menghasilkan uang?

Alamat email

Keuntungan menawar di Freelancer

Tentukan anggaran dan garis waktu Anda

Dapatkan bayaran atas pekerjaan Anda

Uraikan proposal Anda

Gratis mendaftar dan menawar pekerjaan

4 freelancer menawar dengan rata-rata $29 USD untuk pekerjaan ini

@Domus123

Hi, i'm experienced with Lisp/scheme functional programming and algorithms. I can do this for a low price. Thank you

$15 USD dalam 1 hari

5,0

(3 ulasan)

3,0

@usmanhassan123

msc IT and expert in algorithm

$50 USD dalam 1 hari

0,0

(2 ulasan)

0,0

@rezga

I don't think you need to be the best candidate to do this simple task. defining recursive quickSort is one of the best examples when you want to see how Scheme stacks up to other languages when it comes to sorting. In implementation first I created function called partition , which distributes the specified list across two smaller lists—one containing all those elements smaller than the specified pivot, and another with everything else. Then I defined quickSort itself.

$10 USD dalam 0 hari