₦airaland Forum

@seunthomas
It is very insulting when you ignore a mention because you cannot defend your claim. I asked you at 5:22pm to highlight were the errors are in my solution. As at 5:34pm I can see that you are still active on NL. You gave me a challenge and I put my hands up and admitted that I didn't know it. You proposed a solution and I took it considering you set the challenge you must know the answer. I set you a challenge and after calling me all sorts of names you said you would come up with a solution today. You failed to do that. I came up with a solution and you said it was wrong. This is despite your inability to come up with a solution whether it worked or not. I have twice asked you to point out where the errors are and you have ignored me.

How do you meet deadlines at the office? I put it to you that you are a bloody coward unfit to stand where I defecate. A mouth action only guy. You are no programmer.

seunthomas:
Abosolutely........
or there is still more code??

Seunthomas, please can you point out were my solution is wrong? I'm a mere warehouse manager and I'm looking forward to learn

seunthomas:
Abosolutely........
or there is still more code??

Oya start pointing out what's wrong! Can't wait

Seunthomas, this is the concluding part of the solution to the challenge question i threw at you.

Seunthomas, this is the first part of the solution to the question I threw at you yesterday

lordmayor4:
Chat me on whatsapp let's talk. 08164077232

I don't do whatsapp. If you are on telegram (an app very similar to whatsapp but way more secure and anonymous) then let me know

seunthomas come here let me viciously sodomise you.

I will upload screenshots as i type the solution out on Ms word

seunthomas:
Deal....
Please note your question was not language specific and i just need to come up with a
recursive function that can actually terminate without an exit path?

Right??

Who is talking of the recursive question? I am talking of the struct question I gave you. But since you wanna write a recursive function then be my guest. Note that it must satisfy one of two criteria you mentioned; exit due to stack overflow or exit due to out of memory. Let's rumble

timtoday:
But the "thought" of such EXIT is horrifying to say the least. While on some system you could be "presented" with BSOD - blue screen of death. So, am sure that is why asking such question and giving an answer without explanation would raise some dust in so many corners and quarters.

You are welcome to the thread.

@all I am currently stuck in my estate's residents association monthly meeting. I will come back to destroy seunthomas regarding the challenge I threw him. Hopefully he will send me my N400 recharge card

seunthomas:
stop tempting me na. Is it compulsory i must indulge your folly?? If you promise to give me MTN recharge card of just 1500 to the email of my choice if am correct, i will answer it. if not maintain your peace.

If in return you will give me MTN 400 if you are wrong and I am right then we have a deal

seunthomas:
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?

Seunthomas seunthomas seunthomas. Your level of reckless bravado is ridiculous. So are you saying you can write a recursive function that can terminate via stack overflow or out of memory and that function will return something (say void)?

If yes show me an example

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?

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?

guru01:
I got one new challenge for you

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

guru01:
Are you still here.

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

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.

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?

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)

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 .

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

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

lordmayor4:
need of iPhone 5s ash or golden asap this evening, if you have let me know, must be factory unlocked and neat . 
Good price. 
Location... ikeja lagos

I got space gray (ash) 16gb iPhone 5s unlocked. Comes with box, original charger and original earpiece. Charging cable misplaced. OS version 9.2.1. N55k

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.

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?

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:
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

seunthomas:
Yes na, does the callback necessarily need a path of execution which is not recursive? No
This assertion is definately not true. Because a program with an infinty loop can still terminate via stackoverflow.

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

Seunthomas here's the question once again

airsaylongcon:
A procedure "CallBack" is recursive for *some* inputs. If this procedure is guaranteed to terminate, then which of the following is not true.

a) CallBack has a local variable
b) CallBack has an path of execution where it is not recursive (doesn't call itself)
C) CallBack refers to a global variable or has one or more parameters

Now can you show me a functional recursive procedure where there is NO execution path that is not recursive?

seunthomas:
See this guy, i go write 100 self for you since i don know wetin i go do na. But i will wait for @guru01 to kill you first, then you will go defensive and i will supply the code. Better you start begging him down now. I will show mercy then by not supplying him the tools but if God wan catch you the guy go read the whole thread. Overconfidence worry you die and he don finish you. lol. Rolling on the floor now. lol.

I pity you. Go and read the question again. Cos come tomorrow you will be obliterated. Annihilated

seunthomas:
Am not judging you ohhh. Me self i dey shack but with moderation. But i am going to have fun tommorrow. lol......

And who said I was inebriated? I have been communicating with you and if I didn't tell u that I was drinking you would never have known. I only mentioned that I'm a bar slightly tipsy and I'm still forking your brain up.

seunthomas:
You dey ask me?? Even running the jvm with an application using more resources and starving the jvm will cause any infinite loop to say goodnight. @guru01 will be too happy. I was not thinking clearly that time i should have remembered na. lol. I go laugh die tommorrow....

Give me one functional recursive procedure that is guaranteed to terminate that doesn't have an exit path and you have me cornered

seunthomas:
Na the beer dey dull you. You no get sense again. You don use alchol kill all your brain cells finish.

That you sin differently doesn't make u better than me. You no set fork your girlfriend ? Nobi sin be dat? You no set lie? Nobi sin be dat?

As my brain cells don die finish I still dey give u questions wey dey destroy u. Imagine if they were all alive?