In fact O(n^2) is exponentially more than O(log n).

		abhashanand1501 8 hours ago \| parent \| context \| favorite \| on: How we decreased GitLab repo backup times from 48 ... In fact O(n^2) is exponentially more than O(log n).