Implementation of

Selection Sort and

Insertion Sort Algorithm
in Java Programming
Language
Nurul Hikmah
Rizqi Ardian Mashadi
Siti Fitri Yanti Fatimah
WHAT IS
SELECTION SORT AND
INSERTION SORT ALGORITHM ?
 SELECTION SORT

IMPLEMENTATION
ALGORITHM
IMPLEMENTATION
SELECTION SORT
IN JAVA

OUTPUT
FLOWCHART
 INSERTION SORT

IMPLEMENTATION
ALGORITHM
 class InsertionSort {void sort(int arr[])
{ static void printArray(int arr[])

int n = arr.length; {

for (int i = 1; i < n; ++i) { int n = arr.length;

int key = arr[i]; for (int i = 0; i < n; ++i)

int j = i - 1; System.out.print(arr[i] + " ");

while (j >= 0 && arr[j] > key) System.out.println();

{ }

IMPLEMENTATION arr[j + 1] = arr[j]; public static void main(String args[])

{
INSERTION SORT j = j - 1;
} int arr[] = { 12, 11, 13, 5, 6 };
IN JAVA arr[j + 1] = key; InsertionSort ob = new InsertionSort();

} ob.sort(arr);

} printArray(arr);
}
}

OUTPUT
FLOWCHART
 SELECTION SORT INSERTION SORT

Adventages:
 Performs well on small Adventages:
list
 Insertion sort is its simplicity.
 No additional temporary
 The space requirement is
storage is required
minimal.
Disadventages:
Disadventage:
 Its poor efficiency when
 Does not deal well with a huge
dealing with a huge list
list.
of items.
 Useful only when sorting a list
of few items