Welcome to the Lounge

honey the codewitch wrote:

he just wants to poke and prod at people I think.

honey the codewitch wrote:

He's an overachiever. He can't stand the thought of doing something he's not good at. A blessing and a curse.

honey the codewitch wrote:

he must be management that made a wrong turn somewhere

// Wrong.
string result = null;
// ...
if (something)
{
    variable.GetString();
}
return result;

// Also wrong.
string result = null;
// ...
if (something) return variable.GetString();
return result;

// Still wrong.
string result = null;
// ...
if (something)
    return variable.GetString();
return result;

// Less wrong, but wrong.
string result = null;
// ...
if (something)
{
    return variable.GetString();
}
return result;

// The one and only true path!
string result = null;
// ...
if (something)
{
    result = variable.GetString();
}
return result;

honey the codewitch wrote:

sometimes you still need a goto.

/// <summary>
/// Compute the distance between two strings.
/// </summary>
/// <param name="x">The string to search for/compare</param>
/// <param name="y">The string to search in/compare</param>
/// <returns>The distance between two strings. Lower is closer.</returns>
/// <remarks>Calculate the Levenshtein Distance between two strings (the number of insertions, deletions, and substitutions needed to transform the first string into the second)</remarks>
public static int GetDistance(this string x,string y){if(string.IsNullOrEmpty(x))return string.IsNullOrEmpty(y)?0:y.Length;else if(string.IsNullOrEmpty(y))return x.Length;int n=x.Length,m=y.Length;int[,]d=new int[n+1,m+1];if(0==m)return n;for(int i=0;i<=n;d[i,0]=i++);for(int j=0;j<=m;d[0,j]=j++);for(int i=1;i<=n;++i)for(int j=1;j<=m;++j)d[i,j]=Math.Min(Math.Min(d[i-1,j]+1,d[i,j-1]+1),d[i-1,j-1]+((y[j-1]==x[i-1])?0:1));return d[n,m];}

honey the codewitch wrote:

would it have been better or worse if i told you i just write code that way?