Tamamlanmış

nano project - Haskell and scheme -- 2

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.

2. Write a Haskell program that reverse the elements of lists.

Examples: reverse [1,3,5, [6,7,12],8,9,2] => [2,9,8, [12,7,6],5,3,1].

3. Write a Haskell or Scheme function that takes three lists and do the following.

a) Remove identical entries in each list if any.

b) Perform Union on lists that you will get from step a.

c) Perform Intersection on lists that you will get from step a.

Beceriler: Haskell, Scheme

Daha fazlasını gör: nano command header not understood, nanopass compiler, micropass compiler, nanopass needle, nano javascript syntax highlighting, nano syntax highlighting centos, nano syntax highlighting mac, nanopass racket, project for khanconsultancy --2, Project for gertheine -- 2, Project 3 - Casino (2).docx, Project for zeuschoe -- 2, Project for amrelassalart -- 2, project lonestar freelancer 2, freelance cockpit 2 project management v2 2.6, project for opworth 2, project for opworth -- 2, project for louiejayo 2, project for louiejayo -- 2, project for dogmakz 2

İşveren Hakkında:
( 5 değerlendirme ) Dhahran, Saudi Arabia

Proje NO: #15791520

Seçilen:

BlackBaron01

This is a fair offer. I just want to say that i never user Scheme but iam good at Haskell. Relevant Skills and Experience Good knowledge of Haskell. Proposed Milestones $15 USD - All

%selectedBids___i_period_sub_7% gün içinde 15%project_currencyDetails_sign_sub_9% %project_currencyDetails_code_sub_10%
(0 Değerlendirme)
0.0