This document summarizes a presentation on the Tim sort algorithm. It begins with an introduction to Tim sort, noting that it is a sorting algorithm that identifies data members and sorts them using both merge and insertion methods. It then provides examples to demonstrate how Tim sort works step-by-step to sort an array. It explains the process of sorting subsets of the array and then merging the sorted subsets. Finally, it discusses the time and space complexity of Tim sort, noting it has best, average, and worst case time complexities of O(n), O(nlogn), and O(nlogn) respectively, with O(n) space complexity.

1. Course Title: Data Structure Lab
Course Code: ICT-1206
Presentation By:
Misu Das Partha
IT20007
Shouvik Datta
IT20023
Dept. of ICT, MBSTU
Presentation To:
Bikash Kumar Paul
Lecturer,
Dept. of ICT, MBSTU
Date: 1/10/2022

2. TOPIC NAME : TIM SORT
1

3.  CONTENTS
 TOPIC
 INTRODUCTION
 PRESENTATION
 CODE
2

4.  INTRODUCTION
TIM SORT IS A DATA SORTING ALGORITHM.
THIS SORTING STRATEGY IS TO IDENTIFY DATA MEMBERS AND
SORT THEM FURTHER USING BOTH MERGE AND INSERT METHODS.
TIM SORT IS ONE OF THE BEST SORTING ALGORITHMS IN TERMS
OF COMPLEXITY AND STABILITY.
3

5. TIM SORT WORKING WITH EXAMPLES
14 15 45
4 30
29 33 40
27 28
4

6. TIM SORT WORKING WITH EXAMPLES
14 15
45
4
30
29 33 40
27 28
Run = 5
Part-1
Part-2
5

7. FIRSTLY WE ARE SORTING PART-1 ELEMENTS
6

8. TIM SORT WORKING WITH EXAMPLES
14 15 4
27 28
27 15 4
14 28
1st iteration
7

9. TIM SORT WORKING WITH EXAMPLES
14 15 4
27 28
14 15 4
27 28
2nd iteration
8

10. TIM SORT WORKING WITH EXAMPLES
27 15 4
14 28
14 15 4
27 28
3rd iteration
9

11. TIM SORT WORKING WITH EXAMPLES
27 15 4
14 28
14 28 4
15 27
4th iteration
10

12. TIM SORT WORKING WITH EXAMPLES
15 28 4
14 27
4 27 28
14 15
5th iteration
11

13. PART-1 ELEMENTS SORTED
12

14. NOW WE ARE SORTING PART-2 ELEMENTS
13

15. TIM SORT WORKING WITH EXAMPLES
29 33 40
45 30
29 33 40
45 30
1st iteration
14

16. TIM SORT WORKING WITH EXAMPLES
29 33 40
45 30
45 33 40
29 30
2nd iteration
15

17. TIM SORT WORKING WITH EXAMPLES
45 33 40
29 30
30 33 40
29 45
3rd iteration
16

18. TIM SORT WORKING WITH EXAMPLES
30 33 40
29 45
30 45 40
29 33
4th iteration
17

19. TIM SORT WORKING WITH EXAMPLES
30 45 40
29 33
30 40 45
29 33
5th iteration
18

20. PART-2 ELEMENTS SORTED
19

21. NOW WE HAVE TO MERGE PART-1 ELEMENTS
& PART-2 ELEMENTS
20

22. 4 27 28
14 15 30 40 45
29 33
Merged Array
4
21

23. 27 28
14 15 30 40 45
29 33
Merged Array
4 14
22

24. 27 28
15 30 40 45
29 33
Merged Array
4 14 15
23

25. 27 28 30 40 45
29 33
Merged Array
4 14 15 27
24

26. 28 30 40 45
29 33
Merged Array
4 14 15 27 28
25

27. 30 40 45
29 33
Merged Array
4 14 15 27 28
26
30 33 40
29 45

28. Merged Array
4 14 15 27 28 30 33 40
29 45
27

29. 28
 Code
void timSort(int arr[ ], int n){
for (int i = 0; i < n; i+=RUN)
insertionSort(arr, i, min((i+31), (n-1)));
for (int size = RUN; size < n; size = 2*size) {
for (int left = 0; left < n; left += 2*size) {
int mid = left + size - 1;
int right = min((left + 2*size - 1), (n-1));
merge(arr, left, mid, right); }
}
}
int main( ){
int arr[ ] = {27, 14, 28, 15, 4, 45, 29, 30, 33, 40};
int n = sizeof(arr)/sizeof(arr[0]);
printf("Given Array isn");
printArray(arr, n);
timSort(arr, n);
printf("After Sorting Array isn");
printArray(arr, n);
return 0;}

30.  COMPLEXITY OF TIM SORT
Case Time complexity
Best Case O(n)
Average Case O(nlogn)
Worst Case O(nlogn)
Space Complexity O(n)
29

31. THANK YOU FOR WATCHING THIS
PRESENTATION