Which of the following algorithms is NOT suitable for finding the longest continuous subarray where the absolute difference between the maximum and minimum element is less than or equal to a given limit?
A) Sliding Window with Deque.
B) Brute Force Approach.
C) Sorting followed by Two Pointers.
D) Kadane's Algorithm.