苗火 Nicholas

[Data structures]Second optimal search tree

2019-7-5 萧 写技术

#include <stdio.h> #include <stdlib.h> typedef struct _BinaryTree{ int key; struct _BinaryTree *left; struct _BinaryTree *right; }BinaryTree; /* seq[] from 1 to n; sw[0] = 0 */ void secondOptimal(BinaryTree **T, int seq[], float sw[], int low, int high) { BinaryTree *p=...

阅读全文>>

标签: Data Structures data_structures

评论(0) 浏览(1095)

[Data structures]Sequential search

2019-7-4 萧 写技术

#include <stdio.h> #include <stdlib.h> int sequentialSearch(int seq[], int n, int x) { int i; for (i = 0; i < n && x != seq[i]; i++) { } if (i==n) { return -1; } else { return i; } } int orderSequentialSearch(int seq[], int n, int x, int *is) { in...

阅读全文>>

标签: Data Structures data_structures

评论(0) 浏览(1087)

[Data Structures]Merge sort

2019-5-22 萧 写技术

#include <stdio.h> #include <stdlib.h> void merge(int *dst, int *src, int left, int middle, int right) { int i,j,k; k = left; i = left; j = middle+1; while( i<=middle && j<=right ){ if(src[i] < src[j]){ dst[k++] = src[i++]; }else{ dst[k++] ...

阅读全文>>

标签: Data Structures data_structures

评论(0) 浏览(1190)

[Data structures]Heap sort

2019-5-21 萧 写技术

#include <stdio.h> #include <stdlib.h> void heapAdjust(int *queue, int len, int start) { int p = start; int left = (p+1)*2 - 1; int right = (p+1)*2; int min = 0; int tmp; while( left <= len-1 ){ if(right <= len-1){ if(queue[left] < queue[right]){ min...

阅读全文>>

标签: Data Structures data_structures

评论(0) 浏览(1066)

[Data Structures]Selection sort

2019-5-17 萧 写技术

#include <stdio.h> #include <stdlib.h> #define MAX 65535 void simpleSelectionSort(int seq[], int n) { int i; int j; int min; int exchange; for (i=0; i<n; i++) { min = MAX; /* Get the least number */ for (j=i; j<n; j++) { if (seq[j] < min) { mi...

阅读全文>>

标签: Data Structures data_structures

评论(0) 浏览(1102)

[Data Structures] Insertion sort

2019-4-25 萧 写技术

#include <stdio.h> #include <stdlib.h> /* Straight insertion sort */ void straightInsertionSort(int seq[], int n) { int i; int j; int tmp; for (i=1; i<n; i++) {//From 1 tmp = seq[i];//Store yourself for (j=i-1; j>=0 && seq[j]>seq[i]; j--) {//Compare b...

阅读全文>>

标签: Data Structures

评论(0) 浏览(1160)