The increasing order of performance of the searching algorithms are

The performance of searching algorithms is determined by their time complexity. Linear search has O(n) complexity, jump search has O(sqrt(n)), and binary search has O(log n). Since log n < sqrt(n) < n, the increasing order of performance is linear search < jump search < binary search.