苗火 Nicholas

[Data structures]Balance binary search tree (AVL)

2019-7-9 萧 写技术

#include <stdio.h> #include <stdlib.h> typedef struct _BinaryTree{ int key; int bf; struct _BinaryTree *left; struct _BinaryTree *right; }BinaryTree; void R_Rotate(BinaryTree **T) { BinaryTree *lc; lc = (*T)->left; (*T)->left = lc->right; lc->right = ...

阅读全文>>

标签: Data Structures data_structures

评论(0) 浏览(83)

[Data structures]Binary search tree

2019-7-5 萧 写技术

#include <stdio.h> #include <stdlib.h> typedef struct _BinaryTree{ int key; struct _BinaryTree *left; struct _BinaryTree *right; }BinaryTree; int searchBST(BinaryTree *T, int key, BinaryTree *f, BinaryTree **p) { if(T == NULL){ *p = f; return 0; } if(T->key ...

阅读全文>>

标签: Data Structures data_structures

评论(0) 浏览(123)

[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) 浏览(64)

[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) 浏览(71)

[linux]How to build ethtool by crosstool

2019-6-18 萧 写技术

cd ethtool-5.0/ ./configure --host=arm-xilinx-linux-gnueabi-gcc LDFLAGS=-static make

阅读全文>>

标签: embedded linux

评论(0) 浏览(85)

[linux]How to build tcpdump by crosstool

2019-6-18 萧 写技术

cd libpcap-1.9.0/ ./configure --prefix=$PWD/install --host=arm-xilinx-linux-gnueabi --with-pcap=linux make make install cd tcpdump-4.9.2/ ./configure --host=arm-xilinx-linux-gnueabi make

阅读全文>>

标签: embedded linux

评论(0) 浏览(91)

[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) 浏览(133)

[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) 浏览(103)

[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) 浏览(95)

[C] About phrash on function

2019-4-29 萧 写技术

#include <stdio.h> #include <stdlib.h> typedef struct _ss{ int a; int b; }ss; void fun( ss &s){ s.a = 2; s.b = 3; printf("fun:%d %d\n", s.a, s.b); } void fun2(ss *s){ s->a=55; printf("fun2:%d %d\n", s->a, s->b); } void fun3(ss *s){ fun(*s); ...

阅读全文>>

标签: C

评论(0) 浏览(133)