marcinjackowiak

Big O complexities for common methods of Java Collections and common sorting algorithms.


Complexity (Best to Worst)
===================================================================================================
O(1)  <  O(log n)  <  O(n)  <  O(n log n)  <  O(n^2)  <  O(2^n)  <  O(n!)


Collections
===================================================================================================

marcinjackowiak

using UnityEngine;

// Component does nothing; editor script does all the magic
public class SortingLayerExposed : MonoBehaviour { }