Wow, I should have seen this earlier

I think @whoelse has the most awesome solution!

Everybody else just dey blow grammar. See longlong variable names! See comments! Kai, people like to dey WRITE! Me, I come from the old school where when typing into your BBC computer with 8 kilobytes of RAM you dread the ever so common "Out Of Memory" error and remove all them tiresome comments! LOLOLOL!

Complexity analysis? We got some eggheads here! ! Though It really is pretty simple and all programmers should be aware of it. I would link to the wikipedia article but its one of those tiresome pure maths thingies that just makes the simplest stuff seem like wahala

Ah, so @Beaf gave himself the prize by suddenly adding a new condition after the fact? Bad, bad Beaf! But after seeing the prize one can understand why he would want her for himself! LOLOLOL!

Me, would I have entered? Well, no

But only because I don't believe in coding contests where you are judged by some arbitrary factor! If you have a contest where the code is judged by
a. does it compile
b. does it generate the desired output
c. does it have the fewest lines of the submissions
d. does it solve the problem in the shortest time

And the conditions for (b) are CLEARLY stated, then I will surely enter. I dont want someone looking at my code and telling me that because I am comparing two constants I fail!!! LOLOLOLOLOL!

@Beaf I never knew you were a coder. My respect for you has just gone up like 80%!!

After all your endless trolling in the political sections had already eroded that respect to like 2% or something!

Lets see more of you here and less of you there, eh? I have never posted there, or in the romance sections, etc cos I think they are the time wasters of Nairaland, where people go to waste the time God has given them

Jesus Christ!

I am a consultant in the telecom sector but a stark illiterate on this thread

oh well . .that's life

I think @whoelse has the most awesome solution! Cheesy

Everybody else just dey blow grammar.

@Blindcopy, are you a coder or you just wanna say something??

Every programmer here know that all the participants are on some point.

You may as well keep quiet and watch (just advice, no offence)

This has got to be the most interesting and intellectually stimulating thread I have seen on Nairaland in years!

Damn am impressed, this has really pushed up ma interest in programming to like 60%.well am thinking you guys can open a class for wannaBE programmers like me to learn.lookin @ll dose codes like wth are you guys writing.but its all cool, Thumbs up

Interesting Topic

Removed

Na wa ooo, MrBible self dey run code. Na inside bible you learn am? lol.

mr.official

Na wa ooo, MrBible self dey run code. Na inside bible you learn am? lol.

Thank God you showed up here, I was beginning to think that everyone interested in this thread have been caught up in the rapture that was suppose to have taken place last month

The amount of coding in the Bible is more than the coding in any programming language you can think of, the problem is that very few people find the time to decode the coding in the Bible, thereby they make the mistake of allowing false preachers to decode it for them.

MrBible:

I have converted the code Beaf claimed to be the winning code from Whoelse to Java and tested it but it only displays the index of the first pattern. Here is the Java version for anyone to try:

public static void main(String[] args)
{

       int[] searchArray = {1, 3, 0, 0, 8};
       int[] fullArray = {0,8,1,0,0,0,8,6,7,8,9,5,2,6,3,0,7,4,1,1,0,0,7,0,0,8,6,7,8,9,5,9,1,1,3,0,
1,0,0,0,8,6,7,8,9,1,3,0,0,8,5,2,6,3,0,7,4,1,1,0,0,7,0,0,8,6,7,8,9,5,9,1,
1,0,5,2,6,3,0,7,4,1,1,0,0,7,0,0,8,6,7,8,9,5,0,0,8,6,7,8,9,1,3,0,0,8,9,1,};
         
}

@MrBible
Just so u know, Beaf has the winning code.

I also think ur making the same mistake i initially made. Ur variable fullArray is not one array but 3. Take note.

whoelse

I also think your making the same mistake i initially made. your variable fullArray is not one array but 3. Take note.

But why use 3 arrays to hold the fullArray, this is an inefficient way to write codes, when 1 can do the job. I can rewrite the code to use just 1 fullArray. If Beaf will crown me the new winner.

MrBible:

whoelseBut why use 3 arrays to hold the fullArray, this is an inefficient way to write codes, when 1 can do the job. I can rewrite the code to use just 1 fullArray. If Beaf will crown me the new winner.

I feel ur pain bro if this is cos of that hawt prize

MrBible:

whoelse[b]But why use 3 arrays to hold the fullArray[/b], this is an inefficient way to write codes, when 1 can do the job. I can rewrite the code to use just 1 fullArray. If Beaf will crown me the new winner.

Just for a while imagine that ur fullArray is actually 3 arrays as follows.
int[] fullArray1 = {0,8,1,0,0,0,8,6,7,8,9,5,2,6,3,0,7,4,1,1,0,0,7,0,0,8,6,7,8,9,5,9,1,1,3,0};
int[] fullArray2 = {1,0,0,0,8,6,7,8,9,1,3,0,0,8,5,2,6,3,0,7,4,1,1,0,0,7,0,0,8,6,7,8,9,5,9,1};
int[] fullArray3 = {1,0,5,2,6,3,0,7,4,1,1,0,0,7,0,0,8,6,7,8,9,5,0,0,8,6,7,8,9,1,3,0,0,8,9,1};

and also the search Array
int[] searchArray = {1, 3, 0, 0, 8};

Looking at arrays fullArray2 and fullArray3, its easy to see that the searchArray is a contained in both of them.
The trick is mainly in fullArray1 where the searchArray starts from around the end of the array and goes to the beginning.
Do u get now?

Whoelse, thanks I have gone back to check Beaf's initial post and in it he wants the patterns to be in 3 arrays. I have made some improvements to your code to meet Beaf's requirements, I will post the code soon.

MrBible:

mr.official

Thank God you showed up here, I was beginning to think that everyone interested in this thread have been caught up in the rapture that was suppose to have taken place last month

The amount of coding in the Bible is more than the coding in any programming language you can think of, the problem is that very few people find take time to decode the coding in the Bible, thereby they make the mistake of allowing false preachers to decode it for them.

Rapture ke, I been dey expect am before, but since our old man don tell us say him do mistake, say na October 21, me don relax my mind and continue life. Till then again. So which one you come dey decode here? Na from bible?

Rapture ke, I been dey expect am before, but since our old man don tell us say him do mistake, say na October 21, me don relax my mind and continue life. Till then again. So which one you come dey decode here? Na from bible?

Me too I was waiting for the rapture but since the Man Of God Harold Camping got the date wrong, so I decided to take up coding as decoding the date of the rapture and coding are very similar. With very good coders on this forum I'm hoping that we'll all work together so that we can help the MOG Harold Camping to decode the next date of the rapture correctly.

Interesting Topic

Please put your code back into the code tags

MrBible:


Me too I was waiting for the rapture but since the Man Of God Harold Camping got the date wrong, so I decided to take up coding as decoding the date of the rapture and coding are very similar. With very good coders on this forum I'm hoping that we'll all work together so that we can help the MOG Harold Camping to decode the next date of the rapture correctly.

I hope you guyz see am decode. Good luck.

I have actually been looking at this page and would like to make a comment or two. I don't do intense programming in any language, but do some reasonable algorithms building.
Considering the problem posed, I think literally looping the array is not so possible, unless one desires an infinite loop. But it is fairly possible to provide an illusion of looping.

public class SearchArray {

public static void main(String[] args) {
int parentArray[] = {, }
int searchArray[]= {, }

int x[]=new int[parentArray.length+searchArray.length-1);

//provide illusion of looping
for (int i=0;i<=parentArray.length-1;++i){
x[i]=parentArray[i];
}
for (int i=0;i<=searchArray.length-2;++i){
x[parentArray.length+i]=parentArray[i];
}


int p,q,c=0;
//conduct search
for (int i=0;i<=parentArray.length-1;++i){
p=0;q=i;
do {
if (x[q]==searchArray[p]){
++c;
}
else c=0;
++p; ++q;
} while(p<=searchArray.length-1);

if (c==searchArray.length){
System.out.printf("%d\n",i);
c=0;
}
}
}
}

it's also possible to increment the parent Array by its earliest items as one goes about comparing the search Array with it. In this case, a code

x(parentArray.length+i)=parentArray(i); for every case of comparing with search Array. By end of search array, parent Array would have increased by 2*parentArray.length.
Coming late, Hope this makes sense though

This my code in java, i took d array in 1 variable, is dat fyn??
class codes{
    public static void main(String arg[]){
        int code[]={0,8,1,0,0,0,8,6,7,8,9,5,2,6,3,0,7,4,1,1,0,0,7,0,0,8,6,7,8,9,5,9,1,1,3,0,1,0,0,0,8,6,7,8,9,1,3,0,0,8,5,2,6,3,0,7,4,1,1,0,0,7,0,0,8,6,7,8,9,5,9,1,1,0,5,2,6,3,0,7,4,1,1,0,0,7,0,0,8,6,7,8,9,5,0,0,8,6,7,8,9,1,3,0,0,8,9,1};
        for(int x=0;x<code.length;x++){
            try{
                if(code[x]==1&&code[x+1]==3&&code[x+2]==0&&code[x+3]==0&&code[x+4]== {System.out.println("13008";}
            }catch(Exception ex){}
        }
    }
}

let me see if i can work on a scala solution

Any VB guru on here.I need some clarification please,

blindcopy:

@Beaf I never knew you were a coder. My respect for you has just gone up like 80%!!

After all your endless trolling in the political sections had already eroded that respect to like 2% or something!

Lets see more of you here and less of you there, eh? I have never posted there, or in the romance sections, etc cos I think they are the time wasters of Nairaland, where people go to waste the time God has given them

Dude, I am not into the "respect" thing. Opinions differ on various issues and must be expressed freely. Also, people are various things that are not immediately obvious.
what I do with my time is entirely my business. No?

Beaf. but why do u waste so much time and effort in the politics section.

As a coder u should be engaging urself in more intellectual stimulating exercises.

That politics section is just a rabbit hole.

candylips:

Beaf. but why do u waste so much time and effort in the politics section.   

As a coder u should be engaging urself in more intellectual stimulating exercises.

That politics section is just a rabbit hole.

Bros, if dem send una, make una tell dem say una no see me!
Lol! Is the bolded a joke? Except those stimulating exercises can't be found on NL, cos the politics section is far more entertaining than this section.
Most of what you find in this section are many lazy people asking things like "how to send emails."
I'd rather go to the politics section to catch fun and wind up one or two crawling, mud munching, grass gripping clods (there be plenty there [size=4pt] like Gbawe and alj haram lol!!![/size]).

@Beaf

Guy abeg u dey good in Visual Basic 2010? I need help urgently, or can u refer me to anyone abeg?

9ja4eva:

@Beaf

Guy abeg u dey good in Visual Basic 2010? I need help urgently, or can u refer me to anyone abeg?

Nah, I generally advice peeps to switch to C#. However, whats the problem?

Mr Beaf u too like politics

I just came across this thread and I'm loving the coding entries.

@Beaf - Since your original post said the solution should be done in a single for loop, do the Java and C# entries qualify since they are all calling a for loop from a seperate method up to 3 times. So in actual fact, the for loop gets called 3 times and not once. Just saying  

@candylips
Lol! Werin man go do?

Grey Beard:

I just came across this thread and I'm loving the coding entries.

@Beaf - Since your original post said the solution should be done in a single for loop, do the Java and C# entries qualify since they are all calling a for loop from a seperate method up to 3 times. So in actual fact, the for loop gets called 3 times and not once. Just saying  

Which of the examples are you pointing out? The two winning ones don't have that problem (except I'm mistaken).

Beaf am still trying out a functional solution to this problem. Am new to functional programming