thought about it for a bit, and came up with answer, may not be the most efficient. If someone got a better implementation.. post
static int count = 0, i = 0;
public static int...
Type: Posts; User: mia_tech
Re: how to find all occurrences of a number in an array recursivelly
thought about it for a bit, and came up with answer, may not be the most efficient. If someone got a better implementation.. post
static int count = 0, i = 0;
public static int...
Re: how to find all occurrences of a number in an array recursivelly
just count them...
how to find all occurrences of a number in an array recursivelly
guys, given the fact I have an array how can I find all occurrences of the number recursively. I have figure out how to do a linear search recursively, but that would exit once it finds the number......