Download to read offline
![Algorithm
void insertionSort(int arr[], int size) {
for (int i = 1; i < size; i++) {
int key = arr[i];
int j = i - 1;
// Move elements of arr[0..i-1]
that are greater than key to one
position ahead of their current
position
while (j >= 0 && arr[j] > key) {
arr[j + 1] = arr[j];
j--;
}
arr[j + 1] = key;
}
}](https://image.slidesharecdn.com/insertionsort-241112052017-bc2ff167/85/introduction-to-insertion-Sorting-algorithm-5-320.jpg)
![Algorithm
void insertionSort(int arr[], int size) {
for (int i = 1; i < size; i++) {
int key = arr[i];
int j = i - 1;
// Move elements of arr[0..i-1]
that are greater than key to one
position ahead of their current
position
while (j >= 0 && arr[j] > key) {
arr[j + 1] = arr[j];
j--;
}
arr[j + 1] = key;
}
}](https://image.slidesharecdn.com/insertionsort-241112052017-bc2ff167/75/introduction-to-insertion-Sorting-algorithm-5-2048.jpg)
introduction to insertion Sorting algorithm
- 1.
- 2. Introduction In this presentation,we will discuss the insertion sort algorithm and its efficiency in sorting data. We will explore the various aspects of this algorithm and h o w it can be used to optimize the sorting process.
- 3. What is InsertionSort? Insertion sort is a simple sorting algorithm that sorts an array by repeatedly shifting elements to their correct position. It works by iterating through the array and comparing each element with the one before it, swapping them if necessary. This process is repeated until the entire array is sorted.
- 4. Efficiency of Insertion Sort Althoughinsertion sort is a simple algorithm, it is efficient for small arrays or lists. It has a time complexity of O(n^2), which makes it less efficient than other sorting algorithms for larger data sets. However, it is still widely used in practice due to its simplicity and efficiency for small data sets.
- 5. Algorithm void insertionSort(int arr[],int size) { for (int i = 1; i < size; i++) { int key = arr[i]; int j = i - 1; // Move elements of arr[0..i-1] that are greater than key to one position ahead of their current position while (j >= 0 && arr[j] > key) { arr[j + 1] = arr[j]; j--; } arr[j + 1] = key; } }
- 6. Advantages of InsertionSort One of the key advantages of insertion sort is that it is an in-place sorting algorithm, meaning it does not require any extra memory. It is also a stable sorting algorithm, meaning it preserves the relative order of equal elements. Additionally, it is easy to implement and understand.
- 7. Disadvantages of InsertionSort The main disadvantage of insertion sort is its time complexity for larger data sets. It can also be slow when sorting data that is already partially sorted. Furthermore, it m a y not be suitable for sorting complex data types such as objects or structures.
- 8. Conclusion In conclusion, insertionsort is a simple and efficient algorithm for sorting small data sets. While it may not be suitable for larger data sets or complex data types, it is still widely used in practice due to its simplicity and ease of implementation. We hope this presentation has provided you with a comprehensive guide to insertion sort.