Consider a scenario where you have a limited amount of memory available, and you need to sort a large dataset stored on disk. Discuss the feasibility of using bubble sort in this situation and propose an alternative approach if necessary.

Using bubble sort in this scenario is infeasible due to its quadratic time complexity, making it highly inefficient for large datasets. A more suitable alternative would be external sorting algorithms like external merge sort, which involve dividing the dataset into smaller chunks that fit into memory and merging them externally.