title: O(n^log n) algorithm for collision detection
body: <p>I'm building a game engine and I was wondering: are there any algorithms out there for Collision Detection that have time complexity of O(N^log N)?</p>
  
  <p>I haven't written any coding yet, but I can only think of a O(N^2) algorithm (ie: 2 for-loops looping through a list of object to see if there's collision).</p>
  
  <p>Any advice and help will be appreciated.</p>
  
  <p>Thanks</p>