stack-overflow

I was trying to figure out hands-on how tail calls are handled by the C# compiler. (Answer: They're not. But the 64bit JIT(s) WILL do TCE (tail call elimination). Restrictions apply .) So I wrote a small test using a recursive call that prints how many times it gets called before the StackOverflowException kills the process. class Program { static void Main(string[] args) { Rec(); } static int sz = 0; static Random r = new Random(); static void Rec() { sz++; //uncomment for faster, more imprecise runs //if (sz % 100 == 0) { //some code to keep this method from being inlined var zz = r.Next();

Please explain to me why this code produces a StackOverflowException . There is a mistake in one of the lines as I have shown using comment. I do not however understand why this gives me a StackOverflowException . class TimePeriod { private double seconds; public double hour { get { return hour / 3600; } // should be : get { return seconds / 3600; } set { seconds = value * 3600; } } } class Program { static void Main() { TimePeriod t = new TimePeriod(); t.hour = 5; System.Console.WriteLine("Time in hours: " + t.hour); } } Christos This produces a stack-overflow, because there is a recursive

public List<Empleado> ListarEmpleados() { List<Empleado> returnList = new List<Empleado>(); var lista = from u in DB.tabEmpleado select new { u.idEmpleado, u.idUsuario, u.Nombre, u.Apellidos, u.Telefono1 }; foreach (var e in lista) { Empleado empleado = new Empleado(); empleado.idEmpleado = e.idEmpleado; empleado.idUsuario = e.idUsuario; empleado.nombre = e.Nombre; empleado.apellidos = e.Apellidos; empleado.telefono1 = e.Telefono1; returnList.Add(empleado); } return returnList; } This is a WCF service, when is called it returns StackOverflow error in the class definition, exactly in the Set

Here's my code and it runs well with values of 400 to 4000 but once it's about 4mil, I get stack overflow errors. Thanks in advance! public class Fib { static int c=1,b=2; static long sum1=0,sum2=0; static long fib(long a){ if(a==1){ return 1; } if(a==2){ return 2; } else{ return fib(a-1)+fib(a-2); } } public static void main(String[] args){ sum2= fib(4000000); System.out.println("Sum %f" +sum2); } } Yes - you're running out of stack space. It's far from infinite, and you're using it up on each recursive call. You're trying to end up with a stack with 4 million stack frames - that's not going

The following is my stacktrace. I looked through it but it just shows a bunch of views and frankly I'm not too sure what a stackoverflow error is exactly. I read on some of the other questions that some solved theirs through iterations (again, no idea what those are). For the basic layout of the app this is coming from when this crashes is: TabView (5 tabs) > 5th tab > webview in that tab on button press. Now it does actually crash until i hit the back button to go back to the 5th tab and it doesn't do it every time. Thanks for the help! Edit: I stopped testing on the emulator and I have yet