삽입정렬 구현

1 C

C 삽입정렬 구현 문서를 참고하십시오.

#include <stdio.h>
#define ARRAYSIZE(A) sizeof(A)/sizeof((A)[0])
void insertion_sort(int a[], int size) {
	int i, j, temp;
	for(i=1; i<size; i++) {
		temp = a[i];
		for(j=i-1; j>=0; j--) {
		    if(a[j]<temp) break;
		    a[j+1] = a[j];
		}
		a[j+1] = temp;
	}
}
int main() {
	int arr[] = {9,1,22,4,0,-1,1,22,100,10};
	int size = ARRAYSIZE(arr);
	insertion_sort(arr, size);
	for(int i=0; i<size; i++) printf("%d ", arr[i]);
	// -1 0 1 1 4 9 10 22 22 100 
}

2 C++

C++ 삽입정렬 구현 문서를 참고하십시오.

#include <iostream>
void insertion_sort(int a[], int size) {
	int i, j, temp;
	for(i=1; i<size; i++) {
		temp = a[i];
		for(j=i-1; j>=0; j--) {
		    if(a[j]<temp) break;
		    a[j+1] = a[j];
		}
		a[j+1] = temp;
	}
}
int main() {
	int arr[] = {9,1,22,4,0,-1,1,22,100,10};
	insertion_sort(arr, sizeof(arr)/sizeof(int));
	for(int x: arr) std::cout << x << " ";
	// -1 0 1 1 4 9 10 22 22 100 
}

3 C#

C샵 삽입정렬 구현 문서를 참고하십시오.

using System;
class Program {
    static void insertion_sort(int[] a) {
    	int i, j, temp, size=a.Length;
    	for(i=1; i<size; i++) {
    		temp = a[i];
    		for(j=i-1; j>=0; j--) {
    		    if(a[j]<temp) break;
    		    a[j+1] = a[j];
    		}
    		a[j+1] = temp;
    	}
    }
    static void Main() {
        int[] arr = {9,1,22,4,0,-1,1,22,100,10};
        insertion_sort(arr);
        foreach(int i in arr) Console.Write(i+" ");
        // -1 0 1 1 4 9 10 22 22 100  
    }
}

4 Java

Java 삽입정렬 구현 문서를 참고하십시오.

public class MyClass {
    static void insertion_sort(int a[]) {
        int i, j, temp, size = a.length;
        for(i=1; i<size; i++) {
            temp = a[i];
            for(j=i-1; j>=0; j--) {
                if(a[j]<temp) break;
                a[j+1] = a[j];
            }
            a[j+1] = temp;
        }
    }
    public static void main(String args[]) {
    	int[] arr = {9,1,22,4,0,-1,1,22,100,10};
    	insertion_sort(arr);
    	for(int x: arr) System.out.format( "%d ", x );
    	// -1 0 1 1 4 9 10 22 22 100 
    }
}

5 OCaml

let rec isort = function
	| [] -> []
	| h::t -> insert h (isort t)
and insert a = function
	| [] -> [a]
	| h::t when a<h -> [a] @ (h::t)
	| h::t -> [h] @ (insert a t);;

6 PHP

PHP 삽입정렬 구현 문서를 참고하십시오.

<?php
function insertion_sort(&$a) {
    $size = count($a);
    for($i=1; $i<$size; $i++) {
        $temp = $a[$i];
        for($j=$i-1; $j>=0; $j--) {
            if($a[$j]<$temp) break;
            $a[$j+1] = $a[$j];
        }
        $a[$j+1] = $temp;
    }
}
$arr = [9,1,22,4,0,-1,1,22,100,10];
insertion_sort( $arr );
echo implode(' ', $arr);
// -1 0 1 1 4 9 10 22 22 100

7 Python

Python 삽입정렬 구현 문서를 참고하십시오.

def insertion_sort(a):
	for i in range(1, len(a)):
		j = i-1
		key = a[i]
		while a[j]>key and j>=0:
			a[j+1] = a[j]
			j -= 1
		a[j+1] = key
arr = [9,1,22,4,0,-1,1,22,100,10]
insertion_sort(arr)
print( " ".join(map(str,arr)) )
# -1 0 1 1 4 9 10 22 22 100

8 같이 보기

• 거품정렬 구현
• 정렬 구현
• 삽입정렬

9 참고

• https://www.geeksforgeeks.org/insertion-sort/