-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathInsertionSortnew.java
More file actions
53 lines (45 loc) · 1.33 KB
/
InsertionSortnew.java
File metadata and controls
53 lines (45 loc) · 1.33 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
// Program: Insertion Sort Implementation
// Topic: Sorting Algorithms (Arrays)
// Description: Demonstrates the Insertion Sort algorithm to arrange an array of integers in ascending order.
// Elements are compared and inserted into their correct position one by one.
// Includes a helper method to print the array before and after sorting.
package Sorting;
/**
*
* @author Samim
*/
// Java program for implementation of Insertion Sort
class InsertionSortnew {
// Function to sort array using insertion sort
void sort(int arr[])
{
int n = arr.length;
for (int i = 1; i < n; i++) {
int key = arr[i];
int j = i - 1;
while (j >= 0 && arr[j] > key) {
//System.out.println(i+" "+j);
arr[j + 1] = arr[j];
j = j - 1;
//printArray(arr);
}
arr[j + 1] = key;
}
}
// A utility function to print array of size n
void printArray(int arr[])
{
int n = arr.length;
for (int i = 0; i < n; ++i)
System.out.print(arr[i] + " ");
System.out.println();
}
// Driver method
public static void main(String args[])
{
int arr[] = {85, 12, 59, 45,72, 51 };
InsertionSortnew ob = new InsertionSortnew();
ob.sort(arr);
ob.printArray(arr);
}
}