Final answer:
Quick sort is typically not used with doubly-linked lists because it requires random access for efficient partitioning, which doubly-linked lists do not support as they require sequential access.
Correct option is a. Bubble sort
Step-by-step explanation:
The question is asking which sorting algorithm cannot be effectively applied to a doubly-linked list. Using sorting algorithms on different data structures can sometimes be impractical or inefficient, even if it's theoretically possible to implement them.
Bubble sort, insertion sort, and merge sort can all be implemented on a doubly-linked list. The bubble sort algorithm can be easily adapted to a doubly-linked list by using pointers to traverse forwards and backwards as necessary. Insertion sort can also be utilized with a doubly-linked list to insert elements at their correct positions by traversing the list. Merge sort is a bit more complex because it requires splitting the list and merging sections back together, but it can be done.
However, quick sort is typically harder to implement on a doubly-linked list efficiently because it requires random access to list elements for partitioning, which is not the strength of a doubly-linked list since it requires sequential access. Therefore, quick sort is the sorting algorithm that cannot be performed on a doubly-linked list in the options provided.