grh1107

Hey, I'm trying to change the color of a textbox border say if a value returned false. private void UserBox_TextChanged(object sender, EventArgs e) { ControlPaint.DrawBorder(e.Graphics, this.ClientRectangle, Color.Red, ButtonBorderStyle.Solid); } } the problem is EventArgs e doesnt have a graphics member, EventArgs should be a PaintEventArgs, but when i change its …

Currently I'm working on Euler Problem 62, Permutations of a cube, the program is searching for a cube that 5 of the permutations are other cubes, I did some online research and found that the cube that im searching for is within the range of an int64, Actually its 12 …

What exactly are you trying to do just use a function within it? you can inject it as a parameter Class A { public A (B instance) { B.SomeMethod; } } Class B { SomeMethod() { Console.WriteLine("injected"); } } or you can use get set method with property look into …

I'm Creating a class that I want to call a recursive function within it. However, the complier says i cant declare a function within a method, I was wondering how I could Recursively call that function, in the method, or how to recursively call that method, with out declaring the …

currently I'm rewriting old euler solutions into classes so i can store them in a library. I wrote a program that digitizes a number so it can check to see if it a pallindrome, The base class digitize dynamically allocates memory for the size of a number and stores each …

I'm trying to create a class which finds the sum of multiples for a given base I have the code written with out a class im just having trouble converting it into a class my total function isnt retrieving the data from the object maybe? /* If we list all …

how you would compute/denote the time complexity of two loops based on different variables? I understand how to compute the time complexity for a simple loop PseduoCode while X<N { while Y<M { Z++ } X++ } one loop occurs N times - time complexity O(N) the other loop occurs …

your program should use a factorial

For bubble sort you just have to count the number of iterations, there is software that can compute the time complexity however [url]http://en.wikipedia.org/wiki/Sorting_algorithm[/url] will solve the problem of best case worse case and average senario best 0(n) average 0(n^2) worst O(n^2)

double avgl (double x) { static int n=0; static double s = 0; s+=x; n++; s/n; lavg = s/n; return lavg; }

Hey, Im having trouble writing a function that will take a limited running average from a file. the running average works just fine, its just when i try to limit the input, i just come out to inf. could it possibly be that im using a static double for the …