1. function quickFixSort(arr, minVal, maxVal) {
  2. // Input validation
  3. if (!Array.isArray(arr)) {
  4. return "Invalid input: Input must be an array.";
  5. }
  7. if (arr.length === 0) {
  8. return arr; // Return empty array if input is empty
  9. }
  11. if (typeof minVal !== 'number' || typeof maxVal !== 'number') {
  12. return "Invalid input: minVal and maxVal must be numbers.";
  13. }
  15. if (minVal > maxVal) {
  16. return "Invalid input: minVal must be less than or equal to maxVal.";
  17. }
  19. // Partitioning function
  20. function partition(arr, low, high) {
  21. const pivot = arr[high];
  22. let i = low - 1;
  24. for (let j = low; j <= high - 1; j++) {
  25. if (arr[j] <= pivot) {
  26. i++;
  27. [arr[i], arr[j]] = [arr[j], arr[i]]; // Swap
  28. }
  29. }
  30. [arr[i + 1], arr[high]] = [arr[high], arr[i + 1]]; // Swap pivot to correct position
  31. return i + 1;
  32. }
  34. // Recursive function to perform quicksort
  35. function quickSort(arr, low, high) {
  36. if (low < high) {
  37. const partitionIndex = partition(arr, low, high);
  39. quickSort(arr, low, partitionIndex - 1); // Sort left partition
  40. quickSort(arr, partitionIndex + 1, high); // Sort right partition
  41. }
  42. }
  44. //Check if all elements are within range
  45. for (let i = 0; i < arr.length; i++) {
  46. if (arr[i] < minVal || arr[i] > maxVal) {
  47. return "Some elements are outside the specified range [minVal, maxVal].";
  48. }
  49. }
  51. // Perform quicksort
  52. quickSort(arr, 0, arr.length - 1);
  53. return arr;
  54. }

Add your comment