airsaylongcon:


I laugh in edo ijaw and small itsekiri. So you will cause a stackoverflow in order to make your recursive function terminate?

Mr man, respect yourself. No one causes stackoverflow, it just happens, many things can cause it. If you are humble tommorrow i will explain some causes..... That are not even deliberate...

Its a pity your co-convict is not awake now. He himself na too thief crown he sabi. Men without Honour. mtcheeewww.

seunthomas:

Mr man, respect yourself. No one causes stackoverflow, it just happens, many things can cause it. If you are humble tommorrow i will explain some causes..... That are not even deliberate...

My friend anyone who is relying on a stackoverflow as a guaranteed way for his recursive function to terminate is the dumbest programmer alive. You just rubber stamped the height of your stupidity

The word guaranteed that means that the probability of the recursive probability terminating is 1. Irrespective of available computing resources the procedure will terminate. Relying on a stackoverflow or out of memory for your recursive procedure to terminate means that the probability of it terminating is <1. If a stackoverflow doesn't occur or there's no out-of-memory than it will run forever. It won't terminate. Infinite loop tog badt

airsaylongcon:


My friend anyone who is relying on a stackoverflow as a guaranteed way for his recursive function to terminate is the dumbest programmer alive. You just rubber stamped the height of your stupidity

Will you bet your life's earnings and your whole inheritance that i cant write a program that would terminate even without stack overflow that is an infinite loop?? See you life, even my question has the same challenge for a novice. If you create 2 many threads and dont do the proper tuning your application go just terminate(Even when the threads are in infinite loop). Use the remaining brain wey you get. I rest my case.

seunthomas:

Will you bet your life's earnings and your whole inheritance that i cant write a program that would terminate even without stack overflow that is an infinite loop?? See you life, even my question has the same challenge for a novice. If you create 2 many threads and dont do the proper tuning your application go just terminate(Even when the threads are in infinite loop). Use the remaining brain wey you get. I rest my case.

We aren't talking of any program. We are talking of a RECURSIVE PROCEDURE

seunthomas:
The challenge was worth it. @guru01 challenged @airsaylongcon and he was denied his crown. He will get it tommorrow.

This is so funny. Guru01 gave me a question that I wrote without even testing it on a compiler. And he conceded it was correct. He failed to correctly answer mine. Even if you try to use bojuboju to claim that stackoverflow or out of memory will guarantee termination of a recursive procedure. It puts us on a tie. So where is the crown that he collected?

Or were u tired wen u wrote this rubbish?

op, solve the problem posed.
stop yapping.
talk,talk,talk , talk...

asalimpo:
op, solve the problem posed.
stop yapping.
talk,talk,talk , talk...

Just so that when we battle tomorrow we are all on the same page, here's the question I threw Seunthomas before he veered to resurrect Guru01 question

A data structure is "built" using nodes. Each node has exactly two pointers that point to other nodes. None of the pointers is null. A C program is written to count how many nodes are accessible from any of the nodes in the data structure. The code uses an "indicator" field (initialized to zero for all nodes). Correct the following code so that it works properly as it will not work in its current state

struct t
{
int i;
int m;
struct t *b;
struct t *d;
}

int count(struct t *a)
{
if (a->m) return 0;
return count(a->b) + count(a->d)+1;
}

PS: m is the "indicator" field.

airsaylongcon:


This is so funny. Guru01 gave me a question that I wrote without even testing it on a compiler. And he conceded it was correct. He failed to correctly answer mine. Even if you try to use bojuboju to claim that stackoverflow or out of memory will guarantee termination of a recursive procedure. It puts us on a tie. So where is the crown that he collected?

Or were u tired wen u wrote this rubbish?

Well the conclusion here is that you cant ask an reasonable questions. You asked 2 questions here and both questions you did not even know the answer. How you go ask question wey u no sabi the answer. It means that any question or contribution you make here may not even be valid na.

seunthomas:

Well the conclusion here is that you cant ask an reasonable questions. You asked 2 questions here and both questions you did not even know the answer. How you go ask question wey u no sabi the answer. It means that any question or contribution you make here may not even be valid na.

I will so slaughter you today. I'm waiting for sunlight when all the others will be awake. Your reputation as a top dawg programmer will be torn to shreds

airsaylongcon:


I will so slaughter you today. I'm waiting for sunlight when all the others will be awake. Your reputation as a top dawg programmer will be torn to shreds

It is already torn on this thread already, his own don finish already.

airsaylongcon:


I will so slaughter you today. I'm waiting for sunlight when all the others will be awake. Your reputation as a top dawg programmer will be torn to shreds

Yours has been destroyed already na @dhtml so what are u still trying to prove??

I need guys like asalimpo, FincoApps, mobolaji88 guru01 to indicate that they are awake and observing lemme slay seunthomas. Tí ẹ bá jẹ́ léni

airsaylongcon:
I need guys like asalimpo, FincoApps, mobolaji88 guru01 to indicate that they are awake and observing lemme slay seunthomas. Tí ẹ bá jẹ́ léni

Shaking my head ohhhh. You should know that peradventure u try to slay me. I would always bounce back. Whatever secret weapon you think you have, maybe its time to bow out honorably. Why push this any further.....

He has been repeatedly slaughtered, but still refusing to give up the ghost. . . .

seunthomas:

Shaking my head ohhhh. You should know that peradventure u try to slay me. I would always bounce back. Whatever secret weapon you think you have, maybe its time to bow out honorably. Why push this any further.....

You haven't given an answer, a working solution to the code I gave you. Let me give you a hint, you only have to add one line of code to what I've given .

airsaylongcon:


You haven't given an answer, a working solution to the code I gave you. Let me give you a hint, you only have to add one line of code to what I've given .

Getting a hint from you would be like committing suicide na. You dont know the question you asked and you are giving hint. I wanted to give the answer only for the purpose of helping others ohhh. I dont consider this a challenge anymore, cos you try to overdo yourself na. You should have stuck to dhtml that you know very well.

seunthomas:

Getting a hint from you would be like committing suicide na. You dont know the question you asked and you are giving hint. I wanted to give the answer only for the purpose of helping others ohhh. I dont consider this a challenge anymore, cos you try to overdo yourself na. You should have stuck to dhtml that you know very well.

I hope the concept of doubly linked list is not strange to you. You do know what doubly linked lists are, don't you?
Also you know the correct syntax of if statement

If <condition> action(s) ;

Action(s) is/are only performed if the <condition> is true

You also know the concept of dot operator to access data or functions of a struct (or class in java)

airsaylongcon:


I hope the concept of doubly linked list is not strange to you. You do know what doubly linked lists are, don't you?
Also you know the correct syntax of if statement

If <condition> action(s) ;

Action(s) is/are only performed if the <condition> is true

You also know the concept of dot operator to access data or functions of a struct (or class in java)

Judge and Jury. You should relax and learn so you wont always show your ignorance na....

seunthomas:

Judge and Jury. You should relax and learn so you wont always show your ignorance na....

I take that to mean you know them. One last check, you do know what the arrow operator ( - > ) means in C?

airsaylongcon:


I take that to mean you know them. One last check, you do know what the arrow operator ( - > ) means in C?

Am not even interested in the challenge anymore @dhtml18 you are just trying to save face.. And yes i started with the c language before moving to c++.

airsaylongcon:


This is so funny. Guru01 gave me a question that I wrote without even testing it on a compiler. And he conceded it was correct. He failed to correctly answer mine. Even if you try to use bojuboju to claim that stackoverflow or out of memory will guarantee termination of a recursive procedure. It puts us on a tie. So where is the crown that he collected?

Or were u tired wen u wrote this rubbish?

Are you still here.

seunthomas:

Am not even interested in the challenge anymore @dhtml18 you are just trying to save face.. And yes i started with the c language before moving to c++.

Where did you see dhtml18? Are you confusing him and me?

And you can back down from the challenge o. That's cowardice.

guru01:

Are you still here.

Alive and kicking. Do you wanna try your hand on the new challenge I threw at your homeboy?

airsaylongcon:


Alive and kicking. Do you wanna try your hand on the new challenge I threw at your homeboy?

I got one new challenge for you

guru01:

Are you still here.

Dont mind that guy bro. The question he asked you. Your answer was correct. i was stressed up with real worker else i could have seen it clearly. The guy no sabi anything at all. He just they rub him ego. LOL.

guru01:

I got one new challenge for you

Dont bother yourself. He wont even be able to answer it. He does not have foundation knowledge of programming.

guru01:

I got one new challenge for you

Not interested. I am in the middle of a challenge with seunthomas. Join the queue

seunthomas:

Dont mind that guy bro. The question he asked you. Your answer was correct. i was stressed up with real worker else i could have seen it clearly. The guy no sabi anything at all. He just they rub him ego. LOL.

When I am done thrashing you on the challenge I gave you, I will go back to that question and thrash both of you.

Mgbọ guru01 a fully working recursive procedure does not need an exit path. Is this true?

airsaylongcon:


When I am done thrashing you on the challenge I gave you, I will go back to that question and thrash both of you.

Mgbọ guru01 a fully working recursive procedure does not need an exit path. Is this true?

A recursive function can actually terminate without an exit path
a. scenerio out of memory (know this about java)
b. stack overflow( saw this online)

seunthomas:

A recursive function can actually terminate without an exit path
a. scenerio out of memory (know this about java)
b. stack overflow( saw this online)

OK write me a recursive procedure guaranteed to terminate illustrating the above trash

What will the procedure/function return as it's value when any of the above occurs?

airsaylongcon:


OK write me a recursive procedure guaranteed to terminate illustrating the above trash

What will the procedure/function return as it's value when any of the above occurs?

Not all functions return a value. some functions return void and in primitive languages void is not a type. I can write the program but i would be rubbing your already wounded ego. If i stop discussing with you right now i would be vindicated. Already trashed u in my own question, have the solution to your own challenge and even help confirm that a fellow programmer @guru01 got the right answer in the question you asked him, which by the way you did not know the answer of. What more do you want na?