C++

AlgorithmIntroduction> A Question in it. What I saw this morning. For example, if a [0]> A [1], a [0] And a [1] are a reverse order. haha. as mentioned in the book, Merge Sorting is used. I implemented it. The idea is clear and you are enjoying

Self carrying: http://hi.baidu.com/evergreen19/blog/item/dbc1d5f13241c3a5a50f5245.html Recently started writing, RC4, because a lot of swap is required, so the swapAlgorithmEfficiency has a significant impact on the overall speed of RC4,

// Binarysearchtree. H -- 2011-07-27-17.14class binarysearchtree {public: Enum direction {direction_left, direction_right}; typedef int item; typedef struct node {item; struct node * left, * right;} node; private: node * m_root; int m_current; node *

writing is very inefficient. This is a lot of details. It seems that every time you write it, you have to find it again. Just write it. // Binaryheap. CPP -- 2011-08-28-23.06 // purpose: // define methods of Class "binaryheap ". # include "stdafx.

// Graphrepresentasadjacentlist. CPP -- mplement file # include "stdafx. H "# include" graphrepresentasadjacentlist. H "// purpose: // define methods of Class" graphrepresentasadjacentlist ". // Private methods: // vertex

See . There are a lot of content here. Let's take a look at it and you'll see it soon. The preparations for the first anniversary of the last two days are coming soon.ArticleNow, I hope I can have some technical content. I will do it all, huh, I can.

This is something I wrote yesterday. What I really appreciate is that the circular queue is implemented in the same place. It is very clear and has a good idea. /* 12-34-11-04-05-19.32.c -- Chapter 12th, question 1 */ # include "pairingheap.

Orz will die first in the next month. Then it indicates that the Trojan has been lost. Only Then Map Another point is that map must define the # Include # include # include # include using namespace STD; typedef struct node {int X,

follow the introduction to algorithms . // Graphrepresentasadjacentlist. H -- Graph header file. // 2011-09-02-19.38 -- 2011-09-02-21.47 // purpose: // define a class "graphrepresentasadjacentlist ". // declare methods of the class, and define

  An error occurred while allocating space for using malloc.CodeAs follows: Malloc. c: 3096: sysmalloc: assertion '(old_top = (mbinptr) (char *) & (AV)-> bins [(1)-1) * 2])-_ builtin_offsetof (struct malloc_chunk, FD) & old_size = 0) | (unsigned

//binarySearchTree.cpp -- 2011-07-27-17.18#include "stdafx.h"#include "binarySearchTree.h"#include //private methodsbinarySearchTree ::Node * binarySearchTree ::m_makeNode (const Item item){Node * newNode = new Node ;if (NULL == newNode)return NULL ;

//graph.cpp -- 2011-09-02-21.20#include "stdafx.h"#include "graphRepresentAsAdjacentList.h"#include #include const int Size = 5 ;using std ::vector ;int _tmain(int argc, _TCHAR* argv[]){vector indexV ;vector weightV ;graphRepresentAsAdjacentList

//Chessboard.h#include #include #include #include "Chessman.h"//Ignore examining parameter and error.class Chessboard: private Chessman{private:Chessman * * m_chessboard ;m_Direction * * m_whichDirectionFrom ;int m_lenthOfEdge ;int

As you can see, synthesis copying constructor and synthesis assignment operator are prohibited. These are all newly learned. Others are more intuitive. //graphRepresentAsAdjacentMatrix.h --graph header file.//Purpose://A graph represent as a

This is really difficult to say. in the previous section, I thought about this issue when I was thinking about other issues. I studied it myself and looked at it online again. I finally got a result. I have not considered any further issues. this

When I got home from work, I had a mouthful of pickles. After reading the books, I went to bed, because it was too sleepy. (T... really hard. Haha) Woke up at and started to write code .. I wrote a rough story about a part of an exercise. I finished

/* Queue. H -- queue header file */ # include "head. H " /* interface function declaration */ /* operation: before creating and initializing a queue *//*: After PQ points to a queue *//*: if the memory allocation is successful, create and initialize

Let's look at the code. It is also implemented yesterday. /* 2011-04-12-18.00.c -- Explore the Union *//* suppose current machine works as little endian. */ # include Union U { char array [4]; int value; }; /* int main (void); int main

Search for the right shift of arithmetic and the right shift of logic. to be honest, the data structure has come to an end recently. Looking at algorithms, we haven't reached the encoding level yet... a little lonely. so, just yesterday, I saw what

1. Take C ++ as a new language learning (it has nothing to do with C! True .); 2. read thinking in C ++. Do not read c ++ as a dead object. 3. read the C ++ programming language and the inside the C ++ object model. do not be confused by words such