Algorithms/Merge.h at main · justgruba/Algorithms · GitHub

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
//
// Created by justyna on 1/26/21.
//

#ifndef MERGE_SORT_MERGE_H
#define MERGE_SORT_MERGE_H


class Merge {
public: void MergeSo(int arr[], int startInedx, int middleIndex, int endIndex) {
        int totalElements = endIndex - startInedx + 1;
        int *tempArray = new int[totalElements];
        int leftIndex = startInedx;
        int rightIndex = middleIndex + 1;
        int mergedIndex = 0;

        while (leftIndex <= middleIndex && rightIndex <= endIndex) {
            if (arr[leftIndex] <= arr[rightIndex]) {
                tempArray[mergedIndex] = arr[leftIndex];
                ++leftIndex;
            } else {
                tempArray[mergedIndex] = arr[rightIndex];
                ++rightIndex;
            }
            ++mergedIndex;
        }

        while (leftIndex <= middleIndex) {
            tempArray[mergedIndex] = arr[leftIndex];
            ++leftIndex;
            ++mergedIndex;
        }
        while (rightIndex <= endIndex) {
            tempArray[mergedIndex] = arr[rightIndex];
            ++rightIndex;
            ++mergedIndex;
        }
        for (int i = 0; i < totalElements; ++i) {
            arr[startInedx + i] = tempArray[i];

        }
        delete[] tempArray;
        return;
    }

    void MergeSort(int arr[], int startIndex, int endIndex){
        if(startIndex < endIndex){
            int middleIndex = (startIndex + endIndex)/2;

            MergeSort(arr, startIndex, middleIndex);
            MergeSort(arr, middleIndex+1, endIndex);
            MergeSo(arr, startIndex, middleIndex, endIndex);
        }
        return;
    }
};


#endif //MERGE_SORT_MERGE_H