gurdingering
Reputation: 237
How to write procedure that recursively outputs the number of odd digits in a natural number? (racket)
If the input is a number, how can I write a procedure that checks every digit and produces an output equal to the number of odd digits in this number?
I'm thinking about turning the number into a list first, but I'm trying to think of an easier solution.
Also, we're not allowed to use "odd?". So instead of using "odd?" to check whether or not a digit is odd, we can use "quotient"
Upvotes: 1
Views: 108
Answers (1)
adao7000
Reputation: 3670
Rather than convert to a string like in marekful's comment, try recursively taking off the most significant digit at a time using the mod operation. Then, you can use the quotient function to test for odd or even.
Upvotes: 1
Related Questions
- Count odd digits of a number with recursive method
- Write a function in scheme (racket) to return a list of odd integers in a given range
- creating a lisp function that gives a list of even number from a list
- Recursion - Finding the Amount of Even Digits in a Number
- Scheme function that returns the odd-numbered elements from a list in reverse
- Even? function in Scheme (Dr. Racket)
- Calculating if a number is even or odd in scheme using tail recursion
- Scheme write a function that returns number of odd numbers in a list
- Count amount of odd numbers in a sentence
- how to count odd and even number with using PROLOG