java recursive problem
Forum Reply
22 years ago
Highlights
take for example if n = 112 the smallest = 3.apply (1) 2 times u get 28apply (2) 1 time u get 12apply (1) 2 times u get 3if n = 48 then smallest = 1apply (2) 1 time u get 16appl…
22 years ago
very challenging java problem for array
Forum Reply
22 years ago
You are given six equilateral triangles (same sizes) whose edges are numbered. Your task is to form a hexagon (a 6-sided polygon) by matching the edges of the triangles. The edg…
22 years ago
how do I generate a recursive tree and search for the minimum value? User have to enter an integer(n) within the range of 1-5000 he can substract if the integer statisfy the fol…
22 years ago
how do we convert statement like A whale! Down it goes, and more and more... up goes its tail! to A WhalE! DowN IT GoeS, AnD MorE AnD MorE... UP GoeS ItS TaiL!
22 years ago
Latest Activity
See all in DiscussionsYou are given six equilateral triangles (same sizes) whose edges are numbered. Your task is to form a hexagon (a …
22 years ago
take for example if n = 112 the smallest = 3.apply (1) 2 times u get 28apply (2) 1 time …
22 years ago
how do I generate a recursive tree and search for the minimum value? User have to enter an integer(n) within …
22 years ago
Badges
Conversation Opener
Architect
Decade Member
5-Year Veteran
1-Year Veteran
Spotlight
First Steps
Jack-of-Trades
View all badges →