-
Recursive
To all, please help. It is cracking my brain, and my brain juice is drying
up.
Implement a recursive function Half_Of that take in an integer num and display
half of its integer value in each recursive call as long as the values are
greater than 0.
The function returns the number of times it has half num. For example, Half_Of
(21)
displays 10 5 2 1 on the screen and returns 4.
Thanks a lot
-
Re: Recursive
"Lee" <hpbukomsupport2@shell.com.sg> wrote:
>
>To all, please help. It is cracking my brain, and my brain juice is drying
>up.
>
>Implement a recursive function Half_Of that take in an integer num and display
>half of its integer value in each recursive call as long as the values are
>greater than 0.
>The function returns the number of times it has half num. For example, Half_Of
>(21)
>displays 10 5 2 1 on the screen and returns 4.
>
>Thanks a lot
>
int Half_Of(int n)
{
int i;
if (n==0) return 0;
i=n/2;
printf("%i ",i);
return (Half_Of(i)+1);
}
Posting Permissions
- You may not post new threads
- You may not post replies
- You may not post attachments
- You may not edit your posts
Forum Rules
|
Top DevX Stories
Easy Web Services with SQL Server 2005 HTTP Endpoints
JavaOne 2005: Java Platform Roadmap Focuses on Ease of Development, Sun Focuses on the "Free" in F.O.S.S.
Wed Yourself to UML with the Power of Associations
Microsoft to Add AJAX Capabilities to ASP.NET
IBM's Cloudscape Versus MySQL
|
Bookmarks