Got Homework?
Connect with other students for help. It's a free community.
Here's the question you clicked on:
 0 viewing
nimbuzz
Group Title
Create a Scheme function inorder? that consumes a list of numbers numlist and
produces true if the numbers in the list appear in nondecreasing order and false
otherwise. Nondecreasing order means each number in the list is not smaller than the
previous number in the list. Your function will produce true for a list of length 0 or
1. Numbers in the list can be repeated as long as they appear consecutively.
 3 years ago
 3 years ago
nimbuzz Group Title
Create a Scheme function inorder? that consumes a list of numbers numlist and produces true if the numbers in the list appear in nondecreasing order and false otherwise. Nondecreasing order means each number in the list is not smaller than the previous number in the list. Your function will produce true for a list of length 0 or 1. Numbers in the list can be repeated as long as they appear consecutively.
 3 years ago
 3 years ago

This Question is Closed

Narsat Group TitleBest ResponseYou've already chosen the best response.3
It's been waaay too long since I last used Scheme, but I think this is good approximation to the answer, maybe a few minor tweaks could make it right? Hopefully it points you in the right direction. (define (inorder? numlist) (if (null? (cdr numlist) #t (if (> (car numlist) (cadr numlist)) #f (inorder? (cdr numlist)))))
 3 years ago

nimbuzz Group TitleBest ResponseYou've already chosen the best response.0
Thank u very much. But i didn get that. becuase i am new in scheme and our prof said that in assignment we can just use what we learned from lecture. but i am completely lost in it. Is there any way to do this with cond? can this be fine? (define (inorder numlist) (cond ((empty? numlist)true) ((>=(first numlist)(first (rest numlist)))true) ( (< (first numlist) (first(rest numlist)) ) false)))
 3 years ago

Narsat Group TitleBest ResponseYou've already chosen the best response.3
Yeah, if I recall correctly, cond is an 'extended if' basically: (define (inorder? numlist) (cond ((empty? (cdr numlist)) #t) //if 'empty?' doesn't work, try with 'null?' ((> (car numlist) (cadr numlist)) #f) //i don't recall a 'first', but 'car' retrieves first element of a list (else (inorder? (cdr numlist)))))
 3 years ago

nimbuzz Group TitleBest ResponseYou've already chosen the best response.0
oh i get that Thank you )
 3 years ago
See more questions >>>
Your question is ready. Sign up for free to start getting answers.
spraguer
(Moderator)
5
→ View Detailed Profile
is replying to Can someone tell me what button the professor is hitting...
23
 Teamwork 19 Teammate
 Problem Solving 19 Hero
 Engagement 19 Mad Hatter
 You have blocked this person.
 ✔ You're a fan Checking fan status...
Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.