Recent content by dkMft

If n<3 is your "base case". It is not defined here what fd() does, but the important thing is that the recursion tree for Koch() stops here. During the execution of Koch() n will never grow, so you are guaranteed that the base case will be hit at some point. The code below koch(t,m) is not...

Keep track of the other form using a field in your main form: namespace SRV_GUI { public partial class SRSV : Form { private TestForm _otherForm; // instance variable (field) in your main form //... other stuff happens public SRSV() {...

The problem could be solved with a Binary search tree. A standard textbook implementation drops duplicate values on insertion.