{"ScriptPreparationCode":"var arr = new Array(1000);\r\nfor (let i = 0; i \u003C 1000; i\u002B\u002B) {\r\n arr[i] = Math.floor(Math.random() * 1000000); // Random numbers between 0 and 999999\r\n}","TestCases":[{"Name":"Quick Sort ","Code":"function quickSort(arr) {\r\n if (arr.length \u003C= 1) return arr;\r\n \r\n const pivot = arr[Math.floor(arr.length / 2)];\r\n const left = [];\r\n const right = [];\r\n const equal = [];\r\n \r\n for (let element of arr) {\r\n if (element \u003C pivot) {\r\n left.push(element);\r\n } else if (element \u003E pivot) {\r\n right.push(element);\r\n } else {\r\n equal.push(element);\r\n }\r\n }\r\n \r\n return [...quickSort(left), ...equal, ...quickSort(right)];\r\n}\r\n\r\n\r\nquickSort(arr)","IsDeferred":false},{"Name":"Merge Sort","Code":"function mergeSort(arr) {\r\n if (arr.length \u003C= 1) return arr;\r\n \r\n const mid = Math.floor(arr.length / 2);\r\n const left = arr.slice(0, mid);\r\n const right = arr.slice(mid);\r\n \r\n return merge(mergeSort(left), mergeSort(right));\r\n}\r\n\r\nfunction merge(left, right) {\r\n const result = [];\r\n let leftIndex = 0;\r\n let rightIndex = 0;\r\n \r\n while (leftIndex \u003C left.length \u0026\u0026 rightIndex \u003C right.length) {\r\n if (left[leftIndex] \u003C right[rightIndex]) {\r\n result.push(left[leftIndex]);\r\n leftIndex\u002B\u002B;\r\n } else {\r\n result.push(right[rightIndex]);\r\n rightIndex\u002B\u002B;\r\n }\r\n }\r\n \r\n return result.concat(left.slice(leftIndex)).concat(right.slice(rightIndex));\r\n}\r\n\r\n\r\n\r\nmergeSort(arr)","IsDeferred":false}]}