Category Archives: Arrays Programs

Write a Java Program to perform Quick Sort using Static Function

Java Program to perform Quick Sort Quicksort is a divide and conquer algorithm. In a divide and conquer sorting algorithm the original data is separated into two parts “divide” which are individually sorted and “conquered” and then combined. If the array contains only one element or zero elements than the array is sorted. If the… Read More »

Write a Java Program to perform Selection Sort using static function

Java Program to perform Selection Sort Selection sort is a sorting algorithm which sorts the given array elements either in descending or ascending order by finding the misplaced element first and putting it in it’s final place. Selection sort algorithm first selects the lowest (or highest) element and places it in the ordered position. Selection… Read More »