matlab 获得corner点(未完待续)
摘要:clear; close all; clc; I = imread('d.png'); G = rgb2gray(I); %灰度化 level = graythresh(I); %设定阈值 BW = im2bw(I,level); %二值化 BW_edge = edge(BW,'canny'); dim =size(BW); i = floor(dim(1)/2); for m = 1:dim...
阅读全文
posted @
2016-05-23 17:03
各种笔记
阅读(466)
推荐(0)
二叉树遍历
摘要:const int PREORDER=0; const int INEORDER=1; const int POSTEORDER=2; const bool RECURSIVE=true; const bool NONRECURSIVE=false; class MyBinaryTree{ public: class Node{ public: char dat...
阅读全文
posted @
2016-05-20 14:41
各种笔记
阅读(240)
推荐(0)
各种排序算法
摘要:class Sort{ public: void printIt(int const * arr,int const n){ for (int i = 0; i =0 && arr[j]>tmp)arr[j+1] = arr[j--]; arr[j+1]=tmp; } } //2.堆排序12:32----12:53...
阅读全文
posted @
2016-05-19 19:56
各种笔记
阅读(179)
推荐(0)