₦airaland Forum

donjayzi:
@op, what you need is something like this:



Which should give you an output like this:


The starting and stopping number constitute the range. . . .btw, i forked your code (hope you wont mind)

You can take up the code from there, i am not really dhtml18, so i am not up to the challenge

Nice thinking. You have at least hard coded the start and stop values of the range. A better option will be to ask the user to enter these values and you check if they are valid. For example if a user enters 50 and 20 as stop values it's still a valid range but will your code above be able to handle it?

seunthomas:
I blame the 2 people who gave birth to you thinking they have a child. SMH.....

Attack issues not persons. Leave the people that gave birth to me. They are not as intelligent as you that's why I gave you that question to solve. Mr I've-been-coding-since-1998

seunthomas:
You cant please a condemned fool ohhhh. Nothing can be done, nothing at all to save a destined to fail person.

Solve my challenge and redeem your battered image.

Professional coder that cannot see that boundary conditions are crucial. What stops you from asking the user to enter the range he is interested in. And checking that it's a valid range? Nimcompoop

Will that your bustard code give me prime numbers between 9000 and 10000. A small range of just 1000 numbers.

seunthomas:
This is not a smooth and fast solution but should get the work done.

import java.util.Arrays;

public class PrimeChecker{




public static void findPrime(int range){
System.out.println("Listing all prime 2 to " + range);

for (int i = 2; i < range; i++) {

boolean isprime = true;

// check to see if the number is prime
for (int j = 2; j < i; j++) {

if (i % j == 0) {
isprime = false;
break;
}
}
// print the number
if (isprime)
System.out.print(i);
}


}

public static void main(String args[]){
int range=1000;

findPrime(range);


}


}

Rubbish. What if my range is from 9471 to 997629. Dummy starting from 2 like all ranges must start from 1 to any number.

Well sha since I can't solve it lemme not talk

Your a phony, a fake, a ho.

mobolaji88:
Mehnn....this is a lovely thread. But guys @dhtml18 , @seunthomas , @airsaylongcon ...you guys are major code icons and obviously y'all pack some powerful punches in your various areas of computer programming and science.

Please, guys dont turn this to a fight ABEG! lets all just av some fun while facing our daily endeavours...write some short codes, and all just round it up on an educating and mature note. Pls....let love and tolerance reign.

Thanks bossessz,

BTW there is an open question on the floor

I'm not a developer or coder. At least not actively. But I will take up the question you threw. It will take me a bit longer to try and resolve it (compared to more active razor sharp coders). But an old soldier never dies.

Donjayzi is enough ó! U will kill somebody. It aff do. Ẹ don do. Ó ti tó. If seunthomas cannot answer my simple question how can he battle you.

You just remind me of that NAS song ETHER. You've ethhered him. Smack down, Tombstone with full body suplex and closeline. If you add John Cena's FU you will be charged for murder and I will be accused as an accomplice. Please I don't want to go to jail because you killed him oh biko

seunthomas:
see u ohhh. give me ultimatum, why do u have such a premature mind? you want to be both judge and jury. i have proven myself already dont need to any further. and i know for sure u were born premature.

If you have proven yourself why did you ask if I wanted to challenge you? If I wanted you to create a new thread for me and you to battle? Why have you failed to battle me after I agreed to engage you in a duel? I am not a developer and you can't battle me? I am Mr Warehouse and you Professor of Programming since 1998 cannot battle an ordinary warehouse guy? Or wasn't the question I gave you a programming question? Okay let me have your own challenge knowing full well that you couldn't solve mine

donjayzi:
He will never do that:

Here is a good way to describe the OP:

Tobaya, he will say that this code will never run. . .

That your BASIC code will NEVER run. Never ever ever. SEUNTHOMAS can confirm this for me

seunthomas:
You want me to massage your wounded ego??

No. I want you to concede that you do not know the answer.

donjayzi:
What? 14 pages and still running. . .

The guy never chi chum chin ẹ say e wan chop chinchin.

I gave him a challenge and he has just dodgedin has typical self. I'm sure people that got their PhD in Programming since 1998 can't be bothered to answer questions like:


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


SEUNTHOMAS! If were carried in the womb for 9 months come and answer this question. Failure to answer confirms that you were born premature. Last call. After this NEVER ever challenge me in your life or in the after life

seunthomas:
waiting........

Answer my challenge. That's all I want

seunthomas:
Not really. I just paid him back in his own coin. We are talking like matured people but if he wants to get dirty i got some of that stuff too. I am streets too na.

I insulted you and you drag my parents into it and call that paying back in my coin? You streets? No you are one ajebutter. If I show you the streets you will pee in your pants

seunthomas:
Oya, tell us. Mr Warehouse, when did your unlucky father f*ck your unlucky mother and conceive you this useless thing??

That's none of your beeswax! If I become a public figure and that becomes a question I will ask them and they will produce the answer. At least I know there's an answer for that kind of question unlike you that doesn't know.

Now I challenged you to battle you said you needed to create another thread. I challenged you to create another thread, you changed your mind and said you will battle me on this thread. I again threw down the same battle I threw at you 24 hours ago. But like the skilled artful dodger, the perfectionist master dribbler and the only one whose parents wasted school fee on, you have turned a blind eye to 4 posts of the same question.

You call me Mr Warehouse and I take that as a compliment. If not for the job I do you would not be getting your Toothpaste (heck I should even send you expired Toothpaste) or Detergent or even Deodorant (I doubt you use a dey cos you stink from here). It's called Distribution in Supply chain management. And warehousing IS A science. You can read the warehouse science book in the link below.
http://www.isye.gatech.edu/~jjb/wh/book/editions/wh-sci-0.96.pdf

It will do you a world of good. I'm a computing grad but I do not brag I'm the best coder that ever lived. I do not enjoy coding but I CANNOT be bamboozled by skanks like you who hide under the I AM A CODER toga. I am self taught in Distribution Science and use my knowledge in IT to ensure the appropriate use of IT in solving distribution problems. I saw you claim on a thread that you earn over N200k and in my head I am thinking "maybe this guy meant to type Zimbabwean dollars" cos I wouldn't pay N2.00 for your skill. If I were you I would have asked my parents to give me the money they planned to spend on my school fees and then go to nairabet or bet9ja to gamble it away. You are a waste of space and forever will be in my eyes.

You call me Mr Warehouse, I call you apprentice coder. You will forever be in my shadow. Thousands of miles behind me.

Despite opening that your unclean mouth you still can't take me (a non-developer) in battle.

seunthomas:
better than you who did not even contribute an answer na. When a question is asked it needs to be specific precise and meaningful. Questions should not be asked for asking sake. Its people like you who ask questions like when was barrack obama conceived in his mother's womb. lol.

Buffoon! The answer to this question can be inferred. Who wasted school fees on this Negro!

Una see this mumu seunthomas boy. I don drop my challenge again and he has dodged it as usual. He has made a comment at 11:14 am while my challenge was reposted again just before 11am.

Bet seunthomas why your life be like dis? Why are you a Diego Maradona? Are Lionel Messi? Why do you like to dribble me like this?

seunthomas:
The rule is you drop a challenge and i drop one. Dont be irresponsible like someone who managed to clip a challenge point and runs of feeling like he just nuked Godzilla(gotchilla)....

I thought you were running your unclean mouth that you needed to create a new thread since this thread was strictly a challenge between you and your boss who beat and early killed you yesterday. Who showed your parents why the money they spent on your school fees would have been better buying boli or even better if they had used it to clean your sorry bum. You have gone and brought your goons and now you wanna battle on this thread? Are you unaware I dropped a question since yesterday?

I am dropping the challenge again:

Chief Professor Bill Gates seunthomas suck on this as the genius that you are.

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

At least you have had expo since yesterday.

larisoft:
Please, i need everyone who knows a thing or two about algorithms to run my code and tell me if it does not address the stated problem in O(n log k) time.

Airsalong, am tired of doing the whole insult me I i insult you thing ( that is; if i ever did it before now). Now, examine your question, and examine my answer. Algorithms usually have different flavors of implementation, each of which may be less or more optimal. Bucketsort algorithm for instance, has an implementation that resolves its last stages with counting sort, and yet another that resolves it with insertion sort...etc. Each of these implementations vary in performance.

IN the options provided, I see how it is possible to implement a solution that will run in O(n log kn) (D) time. But my solution is obviously better than this. There is also the possiblity that a solution exists that implements the algorithm in O(k) time (which will be really really interesting). Whichever way, my solution is valid.

Please, you or anyone, should tell me why my solution is wrong. Is it because the place you copied your question from, implemented another flavor of the very popular k-array sort problem? Or is it because, you have read the answer and found fault with my algorithm ?

I am just trying to learn.

I have told you that your answer is not even in the options available. You are still bragging. I knew you were going to go for D but how in God's name is that the least optimal solution? We are talking about worst case scenario and you are mentioning log. So what will u say for the big O for best case scenario? Exponential of log I guess

I am a PM. In project development nobody cares about the best case scenario because if it ever does happen every user will be satisfied. However the worst case scenario is very crucial as it will create a lot of dissatisfied users. We aim to evaluate given the worst case scenario the impact it will have on the software and whether the affected users can cope with it. Next time please read a question carefully before you jump in.

seunthomas:
You want me to create a seperate thread for that? Mind you its programming and not WM.

You know what? Create a new thread for it. Me and you let's battle. I will drop a programming challenge from Warehouse management. Bring it on

seunthomas:
"IT" please note this thread is for the runaway @dhtml18. There is enough real estate on nairaland to create a seperate thread for "IT"

Running away as usual eh! Well it's your style. I'm not surprised. Runs in your family so keep it up. You can ask for the thread to be closed now you hear. All hail champion programmer seunthomas that wants a programming challenge as long as it's not in warehouse management. Well done. You are the best programmer alive

Dhtml18 smacked you down with a full body suplex and broke your neck with a closeline and you say he ran away? If he didn't runaway he would have committed murder. And we all know that murder is a crime in this country. He had pity on your parents cos whatever money they wasted training you could have been put to better use

seunthomas:
Dont mind "IT" joor am sure "IT" does not know either of both.

World acclaimed programmer that knows all yet failed a basic java script test. Well done. You know every. Just provide an answer to my challenge dummy

seunthomas:
From all i have seen @guru01 is more intelligent than you. You are just a common agbero am sure u dont even do any prolog or should i quiz you on prolog?

He is unfit to tie my shoes or even stand before me talkless of being more intelligent.

seunthomas:
You want me to create a seperate thread for that? Mind you its programming and not WM.

Hahahahahahahahahaha! Why are you running to a new thread? I dropped the challenge here. Respond here so I can humiliate you in front of everyone here just like dhtml has dragged your sorry add through the mud. And I thought you said I have no clue about Warehousing or Warehouse Management System. Apparently you know better so what's wrong if I throw you a programming question that has to do withe warehouse management. After all I've had to "hack" code together to get some functionality that I need and is not a available in my current WMS solution. As a top notch Badass programmer you should not limit your domain

guru01:
Mouth maker == prolog + project manager of erp.

PROLOG for hobby, PM for work. Now what is it you said you do again Mr PDO/MySQLi? Or you are just a mere coder. A mechanic talking where a mechanical engineer is talking. A hospital cleaner challenging a DR. Go through my posts I never claimed to be a coder. I manage you types who are really technicians.

I cannot be bamboozled by your high sounding words. One pin and like a balloon you will be deflated. Shall I get in challenge with you?

seunthomas:
You refused to enter into a challenge na sissy. Enter and lets us rock and rumble. We need to do this gentlemanly not like agbero.

I already dropped a challenge for you. How else can I have refused to enter a challenge?

donjayzi:
See, i just posted a code not a challenge. You jumped into it like a cowboy and you fumbled like super-eagles. Not my fault.

Solve the challenge posed to you first, before you post any rubbish again .

I've posted and reposted the challenge. But he has mysteriously gone blind when he sees it. His protégé larisoft was given a simple Insertion algorithm to evaluate the speed in big O notation. His dumb fingers typed an answer that wasn't in the options. Na them them dey ask for extra answer sheet for exam when they have been given an answer sheet for multiple choice questions. Dey challenge lecturer say the question no correct. After all them don say browser makers dey make mistake

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

Hahaha. Sucking up. Looking for a way back

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.

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

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

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

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:
Mr non programmer face your Warehouse(wey you no even sabi well).

Mr Lead programmer, CTO and challenger of browser makers, na me dey work for warehouse. I agree I no sabin my job well well. You wey emphatically state say code no go run wey the code come run, na u sabi your work?