selection sort in java
public static void SelectionSort(int[] arr)
{
int small;
for (int i = 0; i <arr.length - 1; i++)
{
small = i;
for (int j = i + 1; j < arr.length; j++)
{
//if current position is less than previous smallest
if (arr[j] < arr[small])
{
small = j;
//swap values
int temp = arr[i];
arr[i] = arr[small];
arr[small] = temp;
}
}
}
}selection sort
// C algorithm for SelectionSort
void selectionSort(int arr[], int n)
{
for(int i = 0; i < n-1; i++)
{
int min = i;
for(int j = i+1; j < n; j++)
{
if(arr[j] < arr[min])
min = j;
}
if(min != i)
{
// Swap
int temp = arr[i];
arr[i] = arr[min];
arr[min] = temp;
}
}
}selection sort
#include <bits/stdc++.h>
using namespace std;
void selectionSort(int arr[], int n){
int i,j,min;
for(i=0;i<n-1;i++){
min = i;
for(j=i+1;j<n;j++){
if(arr[j] < arr[min]){
min = j;
}
}
if(min != i){
swap(arr[i],arr[min]);
}
}
}
int main()
{
int arr[] = { 1,4,2,5,333,3,5,7777,4,4,3,22,1,4,3,666,4,6,8,999,4,3,5,32 };
int n = sizeof(arr) / sizeof(arr[0]);
selectionSort(arr, n);
for(int i = 0; i < n; i++){
cout << arr[i] << " ";
}
return 0;
}Selection sort
SelectionSort(List) {
for(i from 0 to List.Length) {
SmallestElement = List[i]
for(j from i to List.Length) {
if(SmallestElement > List[j]) {
SmallestElement = List[j]
}
}
Swap(List[i], SmallestElement)
}
}Selection Sort
class Sort
{
void selectionSort(int arr[])
{
int pos;
int temp;
for (int i = 0; i < arr.length; i++)
{
pos = i;
for (int j = i+1; j < arr.length; j++)
{
if (arr[j] < arr[pos]) //find the index of the minimum element
{
pos = j;
}
}
temp = arr[pos]; //swap the current element with the minimum element
arr[pos] = arr[i];
arr[i] = temp;
}
}
void display(int arr[]) //display the array
{
for (int i=0; i<arr.length; i++)
{
System.out.print(arr[i]+" ");
}
}
public static void main(String args[])
{
Sort ob = new Sort();
int arr[] = {64,25,12,22,11};
ob.selectionSort(arr);
ob.display(arr);
}
}Selection Sort
# Selection Sort
A = [5, 2, 4, 6, 1, 3]
for i in range(len(A)):
minimum = i
for j in range(i, len(A)):
if A[j] < A[minimum]:
minimum = j
if i != minimum:
A[minimum], A[i] = A[i], A[minimum]Copyright © 2021 Codeinu
Forgot your account's password or having trouble logging into your Account? Don't worry, we'll help you to get back your account. Enter your email address and we'll send you a recovery link to reset your password. If you are experiencing problems resetting your password contact us
