Homework, Data Structure & Algorithms

Write a recursive function the computes the number of digits in a positive integer n.
For example if n = 6598, the function should return 4.
Find a variant expression and a threshold to show that the function has no infinite
recursion.
Posted Date: 11/19/2012 10:46:11 AM | Location : United States







Related Discussions:- Homework, Assignment Help, Ask Question on Homework, Get Answer, Expert's Help, Homework Discussions

Write discussion on Homework
Your posts are moderated
Related Questions
Implement multiple queues in a single dimensional array. Write algorithms for various queue operations for them.

Explain an efficient way of storing a sparse matrix in memory.   A matrix in which number of zero entries are much higher than the number of non zero entries is called sparse mat

Explain in detail the algorithmic implementation of multiple stacks.

Question 1 Write the different characteristics of an algorithm Question 2 Explain in brief the asymptotic notations Question 3 Write an algorithm of insertion sort and e

write an algorithm to delete an element x from binary search with time complex

Enumerate the Types in Ruby Ruby is a pure object-oriented language, meaning that all types in Ruby are classes, and each value in a Ruby program is an instance of a class. Thi

how to write a pseudo code using Kramer''s rule

Byteland county is very famous for luminous jewels. Luminous jewels are used in making beautiful necklaces. A necklace consists of various luminous jewels of particular colour. Nec

Hi, can you give me a quote for an E-R diagram

The below figure illustrates the BOM (Bill of Materials) for product A. The MPS (Material requirements Planning) start row in the master production schedule for product A calls for