#selectionsort

Python Tutorials - Selection Sort Using Python | Sorting Algorithm | Learn Python Programming 

#include<stdio.h> #include<stdlib.h>

void swap(int* var1, int* var2); void printArray(int* ptr, int size); void sort(int* ptr, int size);

int main(void){    int size, i; int* ptr;    printf("Enter size of array: ");    scanf("%d",&size);    ptr = (int*)calloc(size, sizeof(int));    for(i = 0; i < size; i++){        printf("\nEnter element %d: ",(i+1));        scanf("%d",&ptr[i]);    }    printf("\nArray before sorting\n");    printArray(ptr, size);    sort(ptr, size);    printf("\nArray after sorting\n");    printArray(ptr, size);    return 0; }

void swap(int* var1, int* var2){    int temp;    temp = *var1;    *var1 = *var2;    *var2 = temp; }

void printArray(int* ptr, int size){    int i;    for(i = 0; i < size; i++)        printf("%d\t",ptr[i]); }

I wrote the selection sort method in Objective-C. This post will be updated later by adding the Swift version.

A key point of selection sort is when the array is checked for minimum value, searching is started from the next index to the current one. This makes when iteration goes on, elements get reduced.

Metodos de Ordenação - Exemplo de utilização de métodos de ordenação em linguagem C.

Projeto consiste na implementação de um programa exemplo de utilização de métodos de ordenação em linguagem C.

Continuing my series on sorting algorithms implemented in Ruby I'm going to look at Selection Sort in this post. It's not very efficient but is extremely easy to write in Ruby. This time implemented as a method added to the Array class.

class Array def selection_sort sorted_array = Array.new sorted_array << self.delete_at(self.index(self.min)) while self.length > 0 self.replace(sorted_array) end end random_names = File.readlines("randomnames.txt") puts random_names.selection_sort

There's only one line that does all the real work. If I wanted to eschew all the nice Ruby array functions and do things the hard way it might look like this.