Answer Posted / Virendra Kumar Shukla
Selection Sort is a simple sorting algorithm that works by repeatedly finding the minimum element from the unsorted part of the array and putting it at the beginning of the sorted part. It has two main steps: selecting the smallest (or largest, depending on whether it's a min or max heap) element and swapping it with the first (or last) element in the unsorted portion. The time complexity is O(n^2).
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
Explain public static void main(string args[]) in java.
Is minecraft 1.15 out?
explain different ways of using thread? : Java thread
How to sort array in descending order in java?
Write a java program to find the route that connects between Red and Green Cells. General Rules for traversal 1. You can traverse from one cell to another vertically, horizontally or diagonally. 2. You cannot traverse through Black cells. 3. There should be only one Red and Green cell and at least one of each should be present. Otherwise the array is invalid. 4. You cannot revisit a cell that you have already traversed. 5. The maze need not be in the same as given in the above example
What is an object in java and how is it created?
Write a program to print count of empty strings in java 8?
What is a constructor overloading in java?
What is the difference between equals() and == in java?
Write a program to find the whether a number is an Armstrong number or not?
What is a classloader in java?
What is parsing in java?
Differentiate between static and non-static methods in java.
What is java string pool?
What is the difference between break and continue statements?
