omo_to_dun:

If you peruse the code carefully, you'll see that the loop does not necessarily run N times, since i is not incremented in every iteration. If the pattern in the array occurs in a wrap around fashion, as in the first array that beaf posted, then the loop will necessarily iterate more than N-times. Matter of fact, time analysis for the loop is O(N + M - 1)) = O(N + M) for the worst case;

omo_to_dun:

^
Beaf, that is the problem; you should have stated that you wanted all occurrences; you are just confusing everyone. Completely state your goals next time, and don't keep people guessing. Anyway, I dash you one GBOSA for letting folks use their brains, rather than complaining about the dullness of the programming section.

omo_to_dun:

@Beaf
On your next problem, can you, please, include a benchmark program to test for the time analysis of different input? You don't have to do it for all programs; I can help out with C, C++, or Java. [/font][/size]

Beaf:

^
Damn!
Dude, there is no nested loop involved in that solution. I simply decided to loop through the results after they'd been returned, which is not nesting.

I actually ran it on my PC and it worked.

Being the killjoy that I am tho, I went and upped the test to include several instances of the search pattern in each test array (two in each), at random positions.
The new arrays are:
0, 8, 1, 0, 0, 0, 8, 6, 7, 1, 3, 0, 0, 8, 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, 1, 3, 0, 0, 8, 5, 9, 1
1, 0, 5, 2, 6, 3, 0, 7, 4, 1, 1, 0, 0, 7, 0, 0, 8, 1, 3, 0, 0, 8, 0, 0, 8, 6, 7, 8, 9, 1, 3, 0, 0, 8, 9, 1

All entries failed the test. . . Except the one from here; https://www.nairaland.com/nigeria/topic-675768.32.html#msg8406195
It very correctly reported:
Found at 9
Found at 33
Found at 9
Found at 28
Found at 17
Found at 29



LOL!! I therefore shamelessly award the babe below to my humble self (strictly for the cure of a manly "itch"!

Otuabaroku:

^^^ are you kidding me or is it the more I look the less I see. Please can one tell me how this function:


public static int Check(int[] searchArray, int[] fullArray)
{
int j = 0;
int result = -1;
for (int i = 0; i < fullArray.Length; )
{
int x = i + j;
if (x >= fullArray.Length) x -= fullArray.Length;
if (fullArray[x] == searchArray[j])
{
j++;
}
else
{
j = 0;
i++;
}
if (j >= searchArray.Length)
{
result = i;
break;
}
}

return result;
}



will return the individual index of occurrences of a pattern in array that has assuming 5 patterns in it without looping through it to get your answer.

 public static int Check(int[] searchArray, int[] fullArray)
       {
           int j = 0;
           int result = -1;
           for (int i = 0; i < fullArray.Length; )//@@@@@
           {
               int x = i + j;
               if (x >= fullArray.Length) x -= fullArray.Length;
               if (fullArray[x] == searchArray[j])
               {
                   j++;
               }
               else
               {
                   j = 0;
                   i++;//@@@@@
               }
               if (j >= searchArray.Length)
               {
                   result = i;
                   break;
               }
           }

           return result;
       }

Otuabaroku:

Assuming we have 5 patterns in the array, the function will only return the index of the last pattern in the array.

Otuabaroku:

If the function is to return all the index of each pattern that occurred in the array, the means, it will need to return a list of index not just  an int. do you get what i am arriving at.

omo_to_dun:

Wrong. It will return the index of the first pattern in the array. I have tested this!


You are absolutely correct. That's why beaf declared himself the winner since whoelse's code only returns the first occurrence of the pattern, not all the patterns. whoelse assumed, like most of us did, that only the first occurrence was to be returned; that's why all or codes returned an int instead of a list/array.
[/quote
^^^^ Brilliant! If you agree with me that the function needs to return a list/array, that means in order to get the result printed out, you need to iterate the list /array there by using for(or any other ) loop to accomplish the task;hence using 2 loops indirectly. The same can be said about beaf code.

Otuabaroku:

^^^^ Brilliant! If you agree with me that the function needs to return a list/array, that means in order to get the result printed out, you need to iterate the list /array there by using for(or any other ) loop to accomplish the task;hence using 2 loops indirectly. The same can be said about beaf code.

Otuabaroku: ^^^^ Brilliant! If you agree with me that the function needs to return a list/array, that means in order to get the result printed out, you need to iterate the list /array there by using for(or any other ) loop to accomplish the task;hence using 2 loops indirectly. The same can be said about beaf code.

Beaf:

^
Thanks.

The loop was simply for convenience, printing out the output is a bonus. That said, I could have done:

Console.WriteLine(foundPosCollection.ToString(",");

or

Response.Write(String.Join(foundPosCollection, "
"); //web

or

Console.WriteLine(String.Join(foundPosCollection, Environment.NewLine)); //console

Look ma, no loop!! . . .Guy, E be like say you de jealous my babe trophy!

Beaf, that is the problem; you should have stated that you wanted all occurrences; you are just confusing everyone. Completely state your goals next time, and don't keep people guessing. Anyway, I dash you one GBOSA for letting folks use their brains, rather than complaining about the dullness of the programming section.

whoelse:

^^^I'm so envying Beaf too. At least i could have enjoyed that prize while it lasted, Dammnnn.

@omo_to_dun
The funny thing is i actually considered that but as Beaf stated in his question, he just requested for the array as a single unit so its safe to say my assumptions are correct. I still consider myself as part-winner.

@ekt_bear
Seen your posts in other sections. Didnt think programming was your tin. Thumbs up on your analysis.

@Beaf
Where's my share of the prize

Cheesy 'was really smiling like a kid that just got a kiss from the finest babe on the block. Wink

Smiley i loved the grammar you guyz were yarning about the codes; knew & still know nothing Grin about the codes y'all typed and compiled (tis like trying to read arabic Tongue ); but loved the fact that there are fellaz - NL fellaz for that matter - who can do stuff like this. meeeeeeeeeehn! i'm over-impressed. the future indeed is bright! Naija may be rough & chaotic & frustrating right now, but daaaaaaaamn i see 'light beams' @ the end of the tunnel!

great job fellaz! OP, i hail! sharp sharp i don go find bedspace for this hostel. need to hang around this common room alot more.

singing: " . . . the storm is over . . ."

nich:

    'was really smiling like a kid that just got a kiss from the finest babe on the block.  

   i loved the grammar you guyz were yarning about the codes; knew & still know nothing    about the codes y'all typed and compiled (tis like trying to read arabic    ); but loved the fact that there are fellaz - NL fellaz for that matter - who can do stuff like this. meeeeeeeeeehn! i'm over-impressed. the future indeed is bright! Naija may be rough & chaotic & frustrating right now, but daaaaaaaamn i see 'light beams' @ the end of the tunnel!

great job fellaz! OP, i hail! ^{sharp sharp i don go find bedspace for this hostel. need to hang around this common room alot more.}

singing: " .  .  . the storm is over .  .  ."