void selection_sort(BYTE data[], int n) {
for (int i = 0; i < n - 1; i++) {
int jmin = i;
for (int j = i + 1; j < n; j++)
if (data[j] < data[jmin]) jmin = j;
if (jmin != i) SWAP(data[jmin], data[i]);
}
}| Grassfire Algorithm (0) | 2021.03.05 |
|---|---|
| Image Sharpness (0) | 2021.02.25 |
| Bubble Sort (0) | 2021.02.24 |
| Insertion Sort (0) | 2021.02.24 |
| Optimized Median Search (0) | 2021.02.24 |
#define SWAP(a, b) {BYTE tmp = (a); (a) = (b); (b) = tmp;}
void bubble_sort(BYTE data[], int n) {
for (int i = n - 1; i > 0; i--) {
for (int j = 0; j < i; j++) {
if (data[j] > data[j + 1])
SWAP(data[j], data[j + 1]);
}
}
}| Image Sharpness (0) | 2021.02.25 |
|---|---|
| Selection Sort (0) | 2021.02.25 |
| Insertion Sort (0) | 2021.02.24 |
| Optimized Median Search (0) | 2021.02.24 |
| Zhang-Suen Thinning Algorithm (0) | 2021.02.18 |
void insertion_sort ( BYTE *data, int n ) {
int j;
for (int i = 1; i < n; i++ ) {
BYTE remember = data[(j = i)];
while ( --j >= 0 && remember < data[j] ) {
data[j + 1] = data[j];
data[j] = remember;
}
}
}
| Selection Sort (0) | 2021.02.25 |
|---|---|
| Bubble Sort (0) | 2021.02.24 |
| Optimized Median Search (0) | 2021.02.24 |
| Zhang-Suen Thinning Algorithm (0) | 2021.02.18 |
| Is Power of 2 (0) | 2021.02.12 |
|
| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 1 | 2 | 3 | 4 | 5 | 6 | |
| 7 | 8 | 9 | 10 | 11 | 12 | 13 |
| 14 | 15 | 16 | 17 | 18 | 19 | 20 |
| 21 | 22 | 23 | 24 | 25 | 26 | 27 |
| 28 | 29 | 30 |
