Analyze the following pseudocode for a custom sorting algorithm. Determine its Big-O time and space complexity in the best, average, and worst-case scenarios. Identify the specific algorithmic bottlenecks that limit its performance on large, nearly-sorted datasets. Propose a modified version of the algorithm that improves performance by at least an order of magnitude for this specific use case, and explain the theoretical underpinnings of your optimization.