digits_sorted

This site requires JavaScript. It looks like you have disabled JavaScript in your browser or are using a browser that does not support JavaScript. Please enable it or try another browser.

< digit_sum

double_digits >

Main Page → Exercises → Python → Solve an Exercise

Language/Type: Python recursion string return

Write a recursive function named digits_sorted that takes an integer as a parameter and returns True if the digits of the integer are sorted and False otherwise. The digits must be sorted in non-decreasing order (i.e. increasing order with duplicate digits allowed) when read from left to right. An integer that consists of a single digit is sorted by definition. The function should be also able to handle negative numbers. Negative numbers are also considered sorted if their digits are in non-decreasing order.

The following table shows several calls to your function and their expected return values:

Call	Value Returned
`digits_sorted(0)`	`True`
`digits_sorted(2345)`	`True`
`digits_sorted(-2345)`	`True`
`digits_sorted(22334455)`	`True`
`digits_sorted(-5)`	`True`
`digits_sorted(4321)`	`False`
`digits_sorted(24378)`	`False`
`digits_sorted(21)`	`False`
`digits_sorted(-33331)`	`False`

Constraints: Do not declare any global variables. Do not use any loops you must use recursion. Do not use any auxiliary data structures like list, dict, set, etc. Also do not solve this problem using a string. You can declare as many primitive variables like ints as you like. You are allowed to define other "helper" functions if you like they are subject to these same constraints.

Need help?

Stuck on an exercise? Contact your TA or instructor.

Is there a problem? Contact us.

CodeStepByStep

Ad Blocker Detected

digits_sorted