삽입정렬 구현

1 C

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

#include<stdio.h>
void insertion_sort(int arr[], int size) {
	int i, j, key;
	for(i=1; i<size; i++) {
		key = arr[i];
		j = i-1;
		while( j>=0 && arr[j]>key) {
			arr[j+1] = arr[j];
			j--;
		}
		arr[j+1] = key;
	}
}
int main() {
	int arr[] = {3,4,2,1,7,5,8,9,0,6,100,10};
	int size = sizeof(arr)/sizeof(int);
	insertion_sort(arr, size);
	for(int i=0; i<size; i++) printf("%d ", arr[i]);
	// 0 1 2 3 4 5 6 7 8 9 10 100
}

2 C++

#include <iterator>

template<typename biIter>
void insertion_sort(biIter begin, biIter end)
{
    biIter bond = begin;
    for (++bond; bond!=end; ++bond)
    {
      typename std::iterator_traits<biIter>::value_type key = *bond;
      biIter ins = bond;
      biIter pre = ins;
      for (--pre; ins != begin && *pre > key; *ins-- = *pre--);
      *ins = key;
    }
}

3 Java

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

import java.util.Arrays;
public class Main {
    private static void insertion_sort(int arr[]) {
        int i, j, key, size = arr.length;
        for(i=1; i<size; ++i) {
            key = arr[i];
            j = i-1;
            while( j>=0 && arr[j]>key ) {
                arr[j+1] = arr[j];
                j--;
            }
            arr[j+1] = key;
        }
    }
    public static void main(String args[]) {        
        int arr[] = {3,4,2,1,7,5,8,9,0,6,100,10};
        insertion_sort(arr);
        System.out.println( Arrays.toString(arr) );
        // [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 100]
    }
}

4 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);;

5 Python

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

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

6 같이 보기

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