Programming Help

Web Development



What's Here?

  • Members: 150,019
  • Replies: 507,539
  • Topics: 80,008
  • Snippets: 2,668
  • Tutorials: 705
  • Total Online: 1,495
  • Members: 98
  • Guests: 1,397

Welcome to Dream.In.Code
Become a VB Expert!

Join 150,019 VB Programmers for FREE! Get instant access to thousands of VB experts, tutorials, code snippets, and more! There are 1,495 people online right now. Registration is fast and FREE... Join Now!




Reclusive problem

 
 Reply to this topicStart new topic

Reclusive problem, GCF reclusive problem
Russell
14 Nov, 2006 - 02:59 PM
Post #1

New D.I.C Head
*

Joined: 14 Nov, 2006
Posts: 1


My Contributions
I am having trouble with this one part of my code
so far i have (just a little part of it)

[code]Privat function GCF(byval l as integer, byval s as integer) as integer

R = L mod S
If R = o then
GCF = S
else
GCF = GCF(????)
end if
end function [code]

I dont now what goes in the question marks can some one help
User is offlineProfile CardPM
+Quote Post

tody4me
RE: Reclusive Problem
15 Nov, 2006 - 06:39 AM
Post #2

Only Jenny Craig makes thin clients...
Group Icon

Joined: 12 Apr, 2006
Posts: 1,349



Thanked: 5 times
Dream Kudos: 100
My Contributions
Two things, first R should be compared to 0 (zero) not o (o). Second, the command should be GCF = GCF(L, S - 1). You could also do a check to see if L is bigger than S or vice versa, then if L is greater, change the values of L and S and then pass in GCF(L, S-1).

This post has been edited by tody4me: 15 Nov, 2006 - 06:40 AM
User is offlineProfile CardPM
+Quote Post

Fast ReplyReply to this topicStart new topic
Time is now: 1/8/09 09:16PM
Invision Power Board v2.1.7 © 2009  IPS, Inc.
Licensed to: MediaGroup1

Be Social

Dream.In.Code RSS Feed Dream.In.Code LinkedIn Group Follow Us On Twitter

Live VB Help!

VB Tutorials

Reference Sheets

VB Snippets

DIC Chatroom

Bye Bye Ads

Monthly Drawing

Thumb Drive

Top Contributors

Top 10 Kudos This Month