Find Jobs
Hire Freelancers

SCHEME LANGUAGE RSR5

$10-11 USD

Closed
Posted over 3 years ago

$10-11 USD

Paid on delivery
; WITHOUT USING ITERATION, give a complete development (specification, design, code and proof) for a ; procedure which inputs two positive integers n and m, and which returns the largest number which can ; be formed from any m digits in n. ; For example, if n = 11111 and m = 3, then your (main) program will return 111. If n = 14253 and m = 2, ; your program will return 54. Of course m cannot exceed the number of digits in n. ; For this problem, whose solution almost certainly requires auxilliary functions, I want to see ; justification for the functional decomposition which leads to the auxilliary functions. I want to see ; a specification and an induction argument for each recursive function, and I want your certification ; arguments to make full use of pre- and post-conditions for the auxilliary functions whenever these are ; called. Give clear definitions of any terms you introduce to describe your functions. ; You are perfectly free to use ("built-in") scheme primitives such as quotient and expt -- there is ; no need to build and prove an exponentiation function, for example. ; As always, I need to see working tests of your functions.
Project ID: 27744789

About the project

1 proposal
Remote project
Active 3 yrs ago

Looking to make some money?

Benefits of bidding on Freelancer

Set your budget and timeframe
Get paid for your work
Outline your proposal
It's free to sign up and bid on jobs

About the client

Flag of UNITED STATES
BROOKLYN, United States
5.0
11
Payment method verified
Member since May 7, 2020

Client Verification

Thanks! We’ve emailed you a link to claim your free credit.
Something went wrong while sending your email. Please try again.
Registered Users Total Jobs Posted
Freelancer ® is a registered Trademark of Freelancer Technology Pty Limited (ACN 142 189 759)
Copyright © 2024 Freelancer Technology Pty Limited (ACN 142 189 759)
Loading preview
Permission granted for Geolocation.
Your login session has expired and you have been logged out. Please log in again.