O (0) Save time and save space */(*P1) ^= (*P2);{int temp = *P1;*P1 = *P2; With the middle variable speed will be very slow to change space with time*P2 = temp;}}void Main (){time_t ts;unsigned int times = time (ts);Srand (times);int a[100];for (int i = 0; i {cout }unsigned short data = 65535;Data + = 1, fault tolerance, can be handled in any situationprintf ("Brother Fei has%d", data);Cin.get ();}How to i
.
Since we have found the cause, how can we improve it?
The reason is that the previous computation results are not saved, causing Repeated Computation. Then, we save the previous computation results with a variable, and the modifiedCodeAs follows:
VaR Fibonacci = ( Function (){ VaR Temp = {}, Value; Function F (n ){ If (N In Temp) {Value = Temp [N];} Else { If (N = 0 | n = 1 ) {Value = N ;} Else {Value = F (n-1) + f (n-2 );} Temp [N] = Value ;} Return Value ;} Return F ;})();
1 sorting using merge methods2 complete two main functions: Split and Merge3 The better way to split is to use the fast and slow hands, each time you find the middle part of the list to disassemble4 merging can be done in two ways: one is a non-recursive method and the other is a recursive method, all of which can be used.5 individuals prefer recursive methods, which are easier to understand .6 /**7 * Definition for singly-linked list.8 * struct ListNode {9 * int val;Ten * ListNode *next; One *
The principle is very simple: Flip the previous array elements, flip the array elements that follow, and finally flip the entire array element#include#defineN -using namespacestd;void Reverse (int L,int R,int* Array){ double mid= (l+r)/2.0; For (int i=l;i { Array[i]=array[r+l-i]+array[i];Array[r+l-i]=array[i]-array[r+l-i];Array[i]=array[i]-array[r+l-i]; }}int main (){ int array[n],a,b;cout"Array Length:";Cin>>a;cout"Please enter an array element:"; For (int i=0;iCin>>array[i];cout"where the loop
Last night a friend sent me a quick look at the algorithm of the article link, I think the author summed up very well, so I will only the English into Chinese, the rest remains unchanged.Disclaimer: The article content is not my original, the original link programmer all the algorithm speed check table.Data structure OperationsArray sorting algorithmDiagram operationHeap operationsProgrammer algorithm Time-space c
heap for each node, as long as the root node has child nodes while((2*k+1) LastIndex) { //assuming the value of the left node is the largest intBiggerindex =2*k+1; //It means there's a right node. if(Biggerindex LastIndex) { //Select the largest value in the child node if(Data[biggerindex] 1]) {Biggerindex++; } } //compare nodes to child nodes
-sequences until all the records are sorted.Time complexity: Log with base n logarithm of 2Complexity of space: log2n~nSecond, insert class sort: Direct insert sort and shell sortDirect Insert sort: Starts with the second record in the N records to be sorted, compares the previous record and looks for the inserted position, and inserts the current number into the appropriate position at the end of each oute
The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion;
products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the
content of the page makes you feel confusing, please write us an email, we will handle the problem
within 5 days after receiving your email.
If you find any instances of plagiarism from the community, please send an email to:
info-contact@alibabacloud.com
and provide relevant evidence. A staff member will contact you within 5 working days.