How do I explain what a “naive implementation” is? [closed]

Answer 1

A O(n!) algorithm.

foreach(object o in set1)
{
    foreach(object p in set1)
    {
        // codez
    }
}

This will perform fine with small sets and then exponentially worse with larger ones.

Another might be a naive Singleton that doesn't account for threading.

public static SomeObject Instance
{
     get
     {
          if(obj == null)
          {
               obj = new SomeObject();
          }

          return obj;
     }
}

If two threads access that at the same time it's possible for them to get two different versions. Leading to seriously weird bugs.