seunthomas:
I think i have showed maturity by admitting i was wrong. That shows am human ohhh and not like some people wey believe say dem code be perfect coder na.

Shown maturity? You've been humiliated and when u couldn't hide you show the level of your tomfoolery. I gave you a challenge but after you failed that basic java script there's no need challenging u further. Same you running your mouth that you will flawlessly rewrite dhtml18 code. The guy must be having the last laugh

seunthomas:

You are donkey. You changed the single quotes to double quotes.

Now you start talking again, i thought you will say the full code was wrong again. What i gave earlier was a prototype that an advanced programmer can read - it was not meant to be compiler friendly or really run. But then, i have completed it so that an idiot can read and run it too - and you are annoyed eh?

The problem with you is that you are old-school, i am sure if i challenge you to a qbasic 4.5 competition, you might actually win. Or watfor77 (if you truly started coding in 1998, you will know what that means) contest.

guru01:

You are no match for me since you are called a project manager.
Go and play with your erp.

No match for you? Apologies to all coders but let me put it straight to you a project manager to a coder is like a mechanical engineer to a mechanic. Developers also work on erp. Pick up an open source one and learn. Try odoo or weberp. Bitch niccur

@op, in case you failed to realize it

(danielthegreek !== danielthegeek)

donjayzi===dhtml18

So this means that i dhtml18 (under the hood), have succeeded in humilating you once again. . . . .

seunthomas:

even the javascript version is wrong. And it wont work in java.

Why? because he didn't declare i ? sure it won't work, but common it's just an illustration naw. In the context he used it, it's not supposed to work cause it was a clear joke. Please just stop the criticism.

FincoApps:


Why? because he didn't declare i ? sure it won't work, but common it's just an illustration naw. In the context he used it, it's not supposed to work cause it was a clear joke. Please just stop the criticism.

Dont mind him jare, he did not know that donjayzi and dhtml18 are the same person, so he fell right into my trap - and got caught with his pants down!

donjayzi:
@op, in case you failed to realize it

(danielthegreek !== danielthegeek)

donjayzi===dhtml18

So this means that i dhtml18 (under the hood), have succeeded in humilating you once again. . . . .

You are bad! Seunthomas you are a learner. CTO my very black ass

Mscheeew.. With all this long unnecessary thread, i'm yet to see any serious code from OP

airsaylongcon:


No match for you? Apologies to all coders but let me put it straight to you a project manager to a coder is like a mechanical engineer to a mechanic. Developers also work on erp. Pick up an open source one and learn. Try odoo or weberp. Bitch niccur

I know people like you, they claim they are programmers because they associate with programmers.

donjayzi:

Dont mind him jare, he did not know that donjayzi and dhtml18 are the same person, so he fell right into my trap - and got caught with his pants down!

Hahahaha

Op if you feel embattled, you can always beat your chest like king kong /area father and dare anybody or everybody to a fight.

"Are you challenging me to a contest" - remember this your line.

airsaylongcon:


A k-sorted array is a nearly sorted array in which no element is more than k locations away from its final position in the sorted array. Thus, a 0-sorted array is completely sorted and every array of size n is n-sorted. Suppose that A is a k-sorted array of size n. If insertion sort is used to sort A, what is the order of growth of the number of comparisons performed by the sorting algorithm in the worst case?
Give your answer in Big O notation


That's a question combining both data structures and algorithm.

Larisoft come and see o. A little data structures and algorithm question for you as you're seunthomas protégé and need to get your dirty mouth washed with kline and hypo

Lol! I just saw this now while reading the thread again.

So its me and you now eh? lol!

the answer to your question is O(n log k) time when we use insertion sort to sort the nearly sorted arrays. Insertion sort is an algorithm that runs through the array, upon meeting any element, it compares it with all the elements before it, till it finds its proper place in the array, after which it goes back to the element immediately after the swapped one.

Would you like an implementation of this? I got you covered!

here it is in C

void insertionSort(int A[], int size)
{
int i, key, j;
for (i = 1; i < size; i++)
{
key = A[i];
j = i-1;
while (j >= 0 && A[j] > key)
{
A[j+1] = A[j];
j = j-1;
}
A[j+1] = key;
}
}

this will sort the array in O(n log k). n being the length of the array and k being the maximum distance between an array element and its proper place when the array is sorted.

THANKS.

seunthomas:
public static void stdOut(s) {
System.out.print(s);
}

for(int i=1;i<9;i++) {
stdOut('I just dey run my mouth, page '+i);
}
In java your stdOut should be called like this
stdOut("I just dey run my mouth, page "+i);
Take note of the double quotes cause java is very strict.

function stdOut(s) {document.write(s);}
for(i=1;i<9;i++) {
stdOut('I just dey run my mouth, page '+i);
}
And though this is lexically correct in javascript it wont run, because it needs an initializer dom body load event or or some other event that would trigger it

Your java code is even wrong. It should be

public static void stdOut(String s) {System.out.print(s);}

not

seunthomas:
public static void stdOut(s) {
System.out.print(s);
}

Anyone can make mistake

donjayzi:

Now you start talking again, i thought you will say the full code was wrong again. What i gave earlier was a prototype that an advanced programmer can read - it was not meant to be compiler friendly or really run. But then, i have completed it so that an idiot can read and run it too - and you are annoyed eh?

The problem with you is that you are old-school, i am sure if i challenge you to a qbasic 4.5 competition, you might actually win. Or watfor77 (if you truly started coding in 1998, you will know what that means) contest.

Me I know sha ... #underthehood

donjayzi:

Dont mind him jare, he did not know that donjayzi and dhtml18 are the same person, so he fell right into my trap - and got caught with his pants down!

Dude dont vex me. The last guy who did that with my one of my alias, i showed him who was boss. You can ask @slyrox, at least he was a good contender and i respect him for that.

Dhtml abeg come out of the hood o... challenge don finish

@dhtml18 stop hiding come out open.

guru01:

I know people like you, they claim they are programmers because they associate with programmers.

Dude associate with coders? The height of your stupidity is phenomenal. Did you lay your hands on the BBC micro? On the Commodore 64? Atari 8-bit? Do you know what it means to manage 64kb of RAM? Or save programs to a radio cassette? I learnt coding while you where in heaven playing with sand. I write PROLOG for raspberry pi which I'm sure you haven't heard of or ever used. The natural progression for a coder is to rise from rookie coder to software engineer. As a software engineer I chose to specialise in managing software projects. That's miles ahead of were you or your descendants will ever get to. I'm your superior on every level. Stay forever in my shadow

CodeHouse:
Dhtml abeg come out of the hood o... challenge don finish

Which challenge?? He threw the first punch and its my turn to send him his own question. So he has 1 point na(on the house).

@larrysoft if only the person you support could be like you.
Not all talk and no code.
Dhtml challenged him to put his stuff online. He balked.

If he is truly ahead of dhtml, let him show his array of works. Dhtml show his. We judge. Case settled.

Or let him solve the quizzes that were posed here and defend his stand, or show how native loops are recursive or just sharrap and go to bed.

@seunthomas can you pls end this challenge since @dhtml18 is no where to be found. Very unlike him.
After a simple comparison of dhtmlsql with zebra database, he went dark.
@dhtml18 you are no longer the open source driver on nl. You are now a conductor.

seunthomas:

Which challenge?? He threw the first punch and its my turn to send him his own question. So he has 1 point na(on the house).

seun, dont tell us you still want to fight!

asalimpo:

seun, dont tell us you still want to fight!

Was just warming up. At least i have moved from assumed programmer to a contender na. So am waiting for the real dhtml18 to post so i can send him a simple task.

CodeHouse:
Dhtml abeg come out of the hood o... challenge don finish

dhtml18 has been banned, that is why i am under the hood. . .

guru01:
@seunthomas can you pls end this challenge since @dhtml18 is no where to be found. Very unlike him.
After a simple comparison of dhtmlsql with zebra database, he went dark.
@dhtml18 you are no longer the open source driver on nl. You are now a conductor.

bro am sure he will come out. He cant hide for long. I give him till tommorrow and if he does not show up i will force him out.

donjayzi:

dhtml18 has been banned, that is why i am under the hood. . .

I might be able to unban if you want to reenter the challenge.

seunthomas:

bro am sure he will come out. He cant hide for long. I give him till tommorrow and if he does not show up i will force him out.

After i have whooped your ass in the world-wide-web, and exposed you that you no sabi javaScript eh?

If you cannot defeat me, then you are not worthy of challenging the almighty dhtml18!

seunthomas:

I might be able to unban if you want to reenter the challenge.

After you have already lost.

donjayzi:

After i have whooped your ass in the world-wide-web, and exposed you that you no sabi javaScript eh?

Man you are just rubbing your wounded ego. Like i said, one more word from you and i will show you am BOSS.

larisoft:



Lol! I just saw this now while reading the thread again.

So its me and you now eh? lol!

the answer to your question is O(n log k) time when we use insertion sort to sort the nearly sorted arrays. Insertion sort is an algorithm that runs through the array, upon meeting any element, it compares it with all the elements before it, till it finds its proper place in the array, after which it goes back to the element immediately after the swapped one.


Would you like an implementation of this? I got you covered!

here it is in C

void insertionSort(int A[], int size)
{
int i, key, j;
for (i = 1; i < size; i++)
{
key = A[i];
j = i-1;
while (j >= 0 && A[j] > key)
{
A[j+1] = A[j];
j = j-1;
}
A[j+1] = key;
}
}

this will sort the array in O(n log k). n being the length of the array and k being the maximum distance between an array element and its proper place when the array is sorted.

I expect you to take my answer in good faith and if you are humble enough, acknowledge your superiors in this forumn. If not, we shall start our own thread and only then will you know what you are up against. NOOBIE.

Learner! Here are the options available.
A) O(k) (B) O(kn) (C) O(k²n) (D) O(n logk n) [log Base k] (E) O(n²)

Now do you wanna wipe of the rubbish you put up there as none of it is in the options available.

seunthomas:

Which challenge?? He threw the first punch and its my turn to send him his own question. So he has 1 point na(on the house).

My brother... I see you are trying to make a point but i really do not see any reason for this long thread... Because some are silent does not mean you or dhtml are better coders, the more reason why such topics just turn me off, when one person start challenging others, ufffffffff! well as the topic says, it is an issue with you and dhtml and I see you weren't expecting the "punch" to come in that manner.

Everyone saw me give you S.M.A.C.K D.O.W.N in javaScript. I dont need to kill you all over again now?

donjayzi:

After i have whooped your ass in the world-wide-web, and exposed you that you no sabi javaScript eh?

If you cannot defeat me, then you are not worthy of challenging the almighty dhtml18!


After you have already lost.

How could i have lost. There was no equity. You scored a point and did not allow me to present my own challenge task.