-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathMergeSort.m
More file actions
67 lines (60 loc) · 2.04 KB
/
Copy pathMergeSort.m
File metadata and controls
67 lines (60 loc) · 2.04 KB
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
//
// MergeSort.m
// BaseAlgorithm
//
// Created by CC on 2020/4/21.
// Copyright © 2020 kayak. All rights reserved.
//
#import "MergeSort.h"
#import "TestUtil.h"
@implementation MergeSort
-(void)test{
// int *arr = [TestUtil createRandomNumbers:20];
int arr[] = {1,3,11,113,5,6,7,33,16,75,19,88,91,34,69,98,23,21,37,68};
[TestUtil printArray:arr length:20];
[self sort:arr length:20];
[TestUtil printArray:arr length:20];
}
-(void)sort:(int*)arr length:(int)length{
int tmpArr[20];
[self merge:arr tmpArr:tmpArr startIndex:0 endIndex:length-1];
}
-(void)merge:(int *)sourceArr tmpArr:(int *)tmpArr startIndex:(int)startIndex endIndex:(int)endIndex{
if(startIndex<endIndex){
int middleIndex = startIndex + (endIndex-startIndex)/2;
// printf("1 %d %d \n",startIndex,middleIndex);
[self merge:sourceArr tmpArr:tmpArr startIndex:startIndex endIndex:middleIndex];
[self merge:sourceArr tmpArr:tmpArr startIndex:middleIndex+1 endIndex:endIndex];
[self merge:sourceArr tmpArr:tmpArr startIndex:startIndex middleIndex:middleIndex endIndex:endIndex];
}
}
-(void)merge:(int *)sourceArr tmpArr:(int *)tmpArr startIndex:(int)startIndex middleIndex:(int)middleIndex endIndex:(int)endIndex{
int i = startIndex,j = middleIndex+1,k = startIndex;
while (i<=middleIndex&&j<=endIndex) {
if(sourceArr[i] < sourceArr[j]){
tmpArr[k++] = sourceArr[i++];
}else {
tmpArr[k++] = sourceArr[j++];
}
if(tmpArr[k-1]==5){
printf("\n 88-->");
}
}
while (i<=middleIndex) {
tmpArr[k++] = sourceArr[i++];
if(tmpArr[k-1]==5){
printf("\n 88-->");
}
}
while (j<=endIndex) {
tmpArr[k++] = sourceArr[j++];
if(tmpArr[k-1]==5){
printf("\n 88-->");
}
}
for (int n = startIndex;n<=endIndex ; n++) {
sourceArr[n] = tmpArr[n];
}
// memcpy(sourceArr, tmpArr, sizeof(int)*(endIndex-startIndex));
}
@end