is there a way to ignore the stack overflow error(with recursion) because i have a program using recursion but it is not never ending it just takes a while.
here is a snippet i am trying to create a paint bucket.


void bucket(int _x, int _y, int _c){
 int x =_x;
 int y = _y;
 int argb = _c;//selected color
 pixels[x+y*width]=moose;//mouse color
 if(pixels[x-1+y*width]==argb){
   bucket(x-1,y,argb);
 }
   if(pixels[x+1+y*width]==argb){
   bucket(x+1,y,argb);
 }
     if(pixels[x+((y-1)*width)]==argb){
   bucket(x,y-1,argb);
 }
       if(pixels[x+((y+1)*width)]==argb){
   bucket(x,y+1,argb);
 }

}

i only call it once

Perhaps you should try and generate less data to push in the stack:
Code:

void bucket(int x, int y, int argb){
 pixels[x+y*width]=moose;//mouse color
 if(pixels[x-1+y*width]==argb){
   bucket(x-1,y,argb);
 }
   if(pixels[x+1+y*width]==argb){
   bucket(x+1,y,argb);
 }
     if(pixels[x+((y-1)*width)]==argb){
   bucket(x,y-1,argb);
 }
	 if(pixels[x+((y+1)*width)]==argb){
   bucket(x,y+1,argb);
 }

} 

But it is likely that such deeply recursive function will always trip Java.
Somebody had a similar issue a while ago: floodfill help (stackerror)
The solution given by toxi (and slightly improved by myself) is... not to use recursion but to manage the stack manually...