W∴ Balboos, GHB wrote: a boxing match I see what you did there. Tricksy, you are. Software Zen: delete this;

Huh. I close my home office door when I'm having a meeting. My two dogs sleep in my office during the day. Two words: greyhound flatulence X| . Software Zen: delete this;

W∴ Balboos, GHB wrote: it would be easier and less painful for them to replace the big shot and even get one that can be useful. The biggest problem is, they usually don't see that... or they are "closer" to that inept boss than to "a simple dev" M.D.V. ;) If something has a solution... Why do we have to worry about?. If it has no solution... For what reason do we have to worry about? Help me to understand what I'm saying, and I'll explain it better to you Rating helpful answers is nice, but saying thanks can be even nicer.

They're just fools - they were implanted at birth with tracking devices. That alien technology was brought to the world in the early 20th century and full implementation came about with the all-but-mandatory outside-assistance in giving birth. Foil hats won't help. Hint: foil underwear. Ravings en masse^ "The difference between genius and stupidity is that genius has its limits." - Albert Einstein "If you are searching for perfection in others, then you seek disappointment. If you seek perfection in yourself, then you will find failure." - Balboos HaGadol Mar 2010

ok will check on it.

Surprise, surprise.... And that the SEO indexes or position in the results page can be easily "fooled" or just plain bought has nothing to do with this... :mad::mad: X| X| But hey... at the end is just the user responsibility, because he clicks where he shouldn't... :doh: :doh: :doh: M.D.V. ;) If something has a solution... Why do we have to worry about?. If it has no solution... For what reason do we have to worry about? Help me to understand what I'm saying, and I'll explain it better to you Rating helpful answers is nice, but saying thanks can be even nicer.

Well you could try turning the heat setting all the way up on the iron, set it on the ironing board, then cosey up the whole assembly next to you while you're sitting in your work-chair working ... You sound cold.

Kari Trust wrote: I watched a lot of tutorials - on recursion and almost everyone has an example with Fibonacci I can see a single reason for using fibonacci to illustrate recursion: To show that it isn't needed. The keyword is tail recursion. Certainly, a good compiler will detect tail recursion and save stack space and call overhead, generating a simple jump to the top of the function (after fixing up the parameter block, of course), changing the recursion to an iteration. You might as well do that yourself :-) ... unless, of course, you are so deeply into recursive thinking that you find it hard to consider fibonacci anything but recursive. (I can imagine mathematicians that are that way, but not many programmers! To me, the obvious way to write a fibonacci-function would be (I consider the sequence to start with 0, labeled the 0th fibonacci number - some people argue details): static int fib(int n) { if (n < 2) return n; int prev = 1; int fibn = 1; for (int iteration = 2; iteration < n; iteration++) { int fibnext = fibn + prev; prev = fibn; fibn = fibnext; } return fibn; } Bonus sidetrack (or is it?): If you want to make sure that you master recursion, terminating conditions in particular, try this little exercise: Make a console program with recursive function that for each call writes an output line on the console of RecursionDepth number of spaces, followed by an asterisk (and a newline). If the main program calls this function with arguments NumberOfTeeth, BladeWidth, ToothLength, the output should look like a sawblade; the recursion goes to the maximum recursion depth, ToothLength. Then it returns to BladeWidth recursion depth, before it again recurses to ToothLength depth a second time, and repeats this for at total of NumberOfTeeth dives into the maximum depth, before finally returning to the main program. If you are a seasoned recursioner, maybe you will find this problem trivial (in that case, forward it to your students or junior programmers!) I have never ever seen anyone getting this perfectly right on the first try, though! Most programmers give it a first try, then they curse before making the first correction, then they re-curse before making a second correction, ... The cursing often goes to the maximum depth of re-cursing before they get it right :-)

Yeah it seems like they promote the idiots and ass kissers cause they don't know what else to do with them. The less you need, the more you have. JaxCoder.com

Be sure you pay the extra fee for the sterilized probe. Software Zen: delete this;

test :rolleyes: :rolleyes: :rolleyes:

#MeToo :suss:

It was a double entendre. The first instance referring to the golden age the the TV comedy "Saturday Night Live" and the second golden age referring to one's very senior years, hence, referring to the 'for' golden age. Have some prune juice; sit down; relax -🚽 - it will clear your mind and you'll feel better by morning. Ravings en masse^ "The difference between genius and stupidity is that genius has its limits." - Albert Einstein "If you are searching for perfection in others, then you seek disappointment. If you seek perfection in yourself, then you will find failure." - Balboos HaGadol Mar 2010

And we're into mask vs non mask and cherry picking arguments. Sorry, this thread is locked. cheers Chris Maunder

string lbText = ((LinkButton)grvSpeakers.HeaderRow.Cells\[i\].Controls\[0\]).Text; The message suggests that the i index is invalid for the number of cells in the row, or Controls does not contain any items. You need to use the debugger to find out which one is the problem.