Step 1: Note the time complexities
(A) Bubble Sort (worst case): \(O(n^2)\)
(B) Deleting head node in singly linked list: \(O(1)\)
(C) Binary Search: \(O(\log n)\)
(D) Merge Sort (worst case): \(O(n \log n)\)

Step 2: Arrange in increasing order
\[ O(1)\;<\;O(\log n)\;<\;O(n \log n)\;<\;O(n^2) \] So: \[ (B)\;<\;(C)\;<\;(D)\;<\;(A) \]