Spaces:
Running
Running
File size: 2,174 Bytes
501b0f3 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 | function bubbleSort(arr: number[]): number[] {
let n = arr.length;
let swapped: boolean;
// Outer loop for traversing the array
for (let i = 0; i < n; i++) {
swapped = false;
// Inner loop for comparing adjacent elements
for (let j = 0; j < n - i - 1; j++) {
if (arr[j] > arr[j + 1]) {
// Swap the elements if they are in the wrong order
let temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
swapped = true;
}
}
// If no elements were swapped in the inner loop, break out of the loop
if (!swapped) {
break;
}
}
return arr;
}
// Example usage
let arr = [64, 34, 25, 12, 22, 11, 90];
console.log("Sorted array:", bubbleSort(arr));
function mergeSort(arr: number[]): number[] {
// Base case: if the array has only one element or is empty, return it
if (arr.length <= 1) {
return arr;
}
// Find the middle point of the array
const middle = Math.floor(arr.length / 2);
// Divide the array into left and right halves
const left = arr.slice(0, middle);
const right = arr.slice(middle);
// Recursively sort both halves and then merge them
return merge(mergeSort(left), mergeSort(right));
}
// Function to merge two sorted arrays
function merge(left: number[], right: number[]): number[] {
let resultArray: number[] = [];
let leftIndex = 0;
let rightIndex = 0;
// Compare the elements in the left and right arrays and merge them in sorted order
while (leftIndex < left.length && rightIndex < right.length) {
if (left[leftIndex] < right[rightIndex]) {
resultArray.push(left[leftIndex]);
leftIndex++;
} else {
resultArray.push(right[rightIndex]);
rightIndex++;
}
}
// Concatenate any remaining elements in the left or right arrays
return resultArray.concat(left.slice(leftIndex)).concat(right.slice(rightIndex));
}
// Example usage
let arr2 = [38, 27, 43, 3, 9, 82, 10];
console.log("Sorted array:", mergeSort(arr2));
|