"삽입정렬 구현"의 두 판 사이의 차이

2번째 줄: 2번째 줄:
== C ==
== C ==
[[분류: C]]
[[분류: C]]
<source lang="c">
{{참고|C 삽입정렬 구현}}
void insertion_sort ( int *data, int n )
<source lang='c'>
{
#include<stdio.h>
  int i, j, remember;
void insertion_sort(int arr[], int size) {
  for ( i = 1; i < n; i++ )
int i, j, key;
  {
for(i=1; i<size; i++) {
    remember = data[(j=i)];
key = arr[i];
    while ( --j >= 0 && remember < data[j] ){
j = i-1;
        data[j+1] = data[j];
while( j>=0 && arr[j]>key) {
        data[j] = remember;
arr[j+1] = arr[j];
    }
j--;
  }
}
arr[j+1] = key;
}
}
}
</source>
int main() {
<source lang="c">
int arr[] = {3,4,2,1,7,5,8,9,0,6,100,10};
void insertion_sort ( int *data, int n )
int size = sizeof(arr)/sizeof(int);
{
insertion_sort(arr, size);
  int i, j, remember;
for(int i=0; i<size; i++) printf("%d ", arr[i]);
  i = n-1;
// 0 1 2 3 4 5 6 7 8 9 10 100
  while ( i-- > 0 )
  {
    remember = data[(j=i)];
    while ( ++j < n && remember > data[j] );
 
    if ( --j == i ) continue;
    memcpy ( data+i, data+i+1, sizeof(*data) * (j-i) );
    data[j] = remember;
  }
}
}
</source>
</source>

2018년 7월 15일 (일) 16:43 판

1 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

void insertionSort(int[] arr) {
   for(int index = 1 ; index < arr.length ; index++){
      int temp = arr[index];
      int aux = index - 1;
      while( (aux >= 0) && ( arr[aux] > temp ) ) {
         arr[aux+1] = arr[aux];
         aux--;
      }
      arr[aux + 1] = temp;
   }
}

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

def insert_sort(x):
	for i in range(1, len(x)):
		j = i - 1
		key = x[i]
		while x[j] > key and j >= 0:
			x[j+1]  = x[j]
			j = j - 1
		x[j+1] = key
	return x

6 같이 보기

문서 댓글 ({{ doc_comments.length }})
{{ comment.name }} {{ comment.created | snstime }}