Nairaland Forum

Beaf:


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

OK, here's what I mean. In this solution:

PatternSearch(patternArray, searchArray3);
PatternSearch(patternArray, searchArray1);
PatternSearch(patternArray, searchArray2);

private void PatternSearch(int[] patternArray, int[] searchArray)
    {
        int foundPos = -1;
        int foundPosExtendedMode = -1;
        int currSearchElementPos = 0;//current index of searchArray being tested
        int currExtendedModeSearchElementPos = 0;//current index of searchArray being tested in extended mode
        int maxExtendedCycles = 0;
        int patternArrayLength = patternArray.Length;
        bool isLoopInExtendedMode = false;

        for (int i = 0; i < searchArray.Length; i++)
        { ,  }
  }

the method containing the for loop - PatternSearch - is called 3 times. So the same for loop is essentially called 3 times. My question was, can this still count as valid? - Or am I missing something?

candylips:

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

Why not not, bruv? Lets see a different approach, which language are you gonna write in?

I've not been able to take up functional programming despite promising to learn Elang and F# since it became public years ago.
How is you functional language journey?

Grey Beard:

OK, here's what I mean. In this solution:

PatternSearch(patternArray, searchArray3);
PatternSearch(patternArray, searchArray1);
PatternSearch(patternArray, searchArray2);

private void PatternSearch(int[] patternArray, int[] searchArray)
    {
        int foundPos = -1;
        int foundPosExtendedMode = -1;
        int currSearchElementPos = 0;//current index of searchArray being tested
        int currExtendedModeSearchElementPos = 0;//current index of searchArray being tested in extended mode
        int maxExtendedCycles = 0;
        int patternArrayLength = patternArray.Length;
        bool isLoopInExtendedMode = false;

        for (int i = 0; i < searchArray.Length; i++)
        { ,  }
  }

the method containing the for loop - PatternSearch - is called 3 times. So the same for loop is essentially called 3 times. My question was, can this still count as valid? - Or am I missing something?

Lolzzz!
You've made the same mistake as many others. Those 3 calls are the function being tested 3 separate times; there are three distinct arrays to test against, each puts the pattern in a different place to catch any mago-mago coding!
All code must get the 3 answers correct.

Since we're on the subject of functional programming, some, attacking this with JavaScript ,

var array1 = [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];
var array2 = [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];
var array3 = [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];

function findPattern(array, array1, array2){
var result=0;

for(i=0; i<array.length; i++){
if( array[i] == 1 &&
array[i+1] == 3 &&
array[i+2] === 0 &&
array[i+3] === 0 &&
array[i+4] == 8||
array1[i] == 1 &&
array1[i+1] == 3 &&
array1[i+2] === 0 &&
array1[i+3] === 0 &&
array1[i+4] == 8||
array2[i] == 1 &&
array2[i+1] == 3 &&
array2[i+2] === 0 &&
array2[i+3] === 0 &&
array2[i+4] == {
result += 1;

}
}
return result;
}

alert(findPattern(array3, array2, array1) + " Pattern found!";

see is in action here: http://jsbin.com/edopas/edit#source (just click render)

^
That is wrong, sir. You should read the first page thoroughly and go through the winning submissions.
The 3 arrays are meant to be tested individually, and you should get 3 positives not 2.

Beaf:

, The 3 arrays are meant to be tested individually, and you should get 3 positives not 2.

", a single for loop that will find the following pattern (as a single unit): 1,3,0,0,8"

1,3,0,0,8 should be consecutive ,  ? Yes, I did read the previous solutions/post before posting.

Beaf:

, The 3 arrays are meant to be tested individually, and you should get 3 positives not 2 ,

it is, findPattern(array, array1, array2) through a single for loop , look carefully again @ what the code is doing.

^
You are wrong, bruv. Everything about your code is totally wrong; from the approach to the method signature to the result.
I guess getting the wrong result tells it all (even with the hardcoding); you should have 3 positives, not 2.

I have made some improvements to the code given by Whoelse and I feel this is still the best code so far. See the full Java code below:

public class whoelseNumberPetternRun {
    

        
     public static String Check(int[] searchArrayIn, int[] fullArrayIn)
     {    
        
        
    int j = 0;
    String result = "";
    
    for (int i=0; i<fullArrayIn.length - 4        
    {  

           int x = i + j;
           
    if (j < 5 && fullArrayIn[x] == searchArrayIn[j]) 
               {           
                    j++;                   
               }                   
                   else
               {
                                          
                       j = 0;
                       i++;
               }
               
                        
               
               if (j == searchArrayIn.length - 1)
               { 
                    System.out.println("Found at Location: " + i);
                    result += Integer.toString(fullArrayIn[i]) + ",";
                    result += Integer.toString(fullArrayIn[i+1]) + ",";
                    result += Integer.toString(fullArrayIn[i+2]) + ",";
                    result += Integer.toString(fullArrayIn[i+3]) + ",";
                    result += Integer.toString(fullArrayIn[i+4]) + ",";
               }             
                                      
     }
            return result;
          
        }


    public static void main(String[] args) {
        
      int[] searchArray ={1, 3, 0, 0, 8};
      int[] fullArray =  {1,3,0,0,8,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,1,3,0,0,8};    
      int[] fullArray1 = {0,8,1,0,0,1,3,0,0,8,0,8,6,7,8,9,5,2,6,3,0,7,4,1,3,0,0,8,1,1,0,0,7,0,0,8,6,7,8,9,5,9,1,1,3};
      int[] fullArray2 = {0,8,1,0,0,0,8,1,3,0,0,8,6,7,8,9,5,2,6,3,1,3,0,0,8,0,7,4,1,1,0,0,7,0,0,8,6,7,8,9,5,9,1,1,3};    
        
    System.out.println("fullArray " + Check(searchArray, fullArray));
    System.out.println();
    System.out.println("fullArray1 " + Check(searchArray, fullArray1));    
    System.out.println();
    System.out.println("fullArray2 " + Check(searchArray, fullArray2));    
    }
}

[quote author=omo_to_dun]C++ Solution:
[code]
// File: beaf.h

#ifndef BEAF_PROBLEM_I
#define BEAF_PROBLEM_I

/*
* Description: Function beaf searches [array] for the first occurence
*              of the sequence in [pattern].
*
* Param      : [array]          array to be searched.
*            : [pattern]        array containing sequence to search for.
*            : [ARRAY_LENGTH]   size of [array].
*            : [PATTERN_LENGTH] size of

Brother,I love these but no main it wont run or how do you run it?Is it not java code?