classical webcast

treatment, if the sub-problems are not independent, then divide and conquer the law to do a lot of unnecessary work, repeatedly solve the common sub-problem, although it can be divided into a method, but the general use of dynamic programming method is better.Iv. problems that can be solved by the use of split-treatment method(1) Two-point search(2) Large integer multiplication(3) Strassen matrix multiplication(4) Board overlay (5) Merge sort (6) Quick Sort (7) Linear time selection (8) closest

;SummaryIn the writing of C + + programs, when multiple basic data types or composite data structures occupy the same piece of memory, we use a consortium (an example of question one); When multiple types, multiple objects, and many things take only one (let's call it "N-Select 1"), We can also use a consortium to make the most of its strengths (question two is such an example).This article is from the "Song Baohua blog" blog, make sure to keep this source http://21cnbao.blog.51cto.com/109393/12

The basic idea of a direct insert sort (insertion sort) is to insert a record to be sorted each time, by its keyword size, into the appropriate position in the previously ordered subsequence until all the records have been inserted.Set the array to a[0...n-1].1. Initially, a[0] self into 1 ordered areas, unordered area is a[1..n-1]. Make I=12. Merge A[i] into an ordered interval of A[0...I] formed in the current ordered region A[0...i-1].3. i++ and repeat the second step until the i==n-1. Sortin

decision tree on the training data.Because you are putting too much attention on correcting algorithm errors, it is important to have clean data with deleted outliers.SummarizeIn the face of various machine learning algorithms, beginners often ask: "Which algorithm should I use?" The answer to this question depends on a number of factors, including: (1) the size, quality and characteristics of the data, (2) The Available calculation time, (3) The urgency of the task, and (4) What you want to do

used as the queue/team, and B as an auxiliary.Team Full : A full and b is not empty;team NULL : Both A and b are empty;into the stack : inserting new elements into queue A;Out Stack :(1) In addition to the last element, all elements of queue A are inserted into queue B;(2) The last element of queue A is out of the team;(3) Swap the elements of queue B back to queue A;voidStack_pop (queueint> q1, queueint> AMP;Q2,intN) { intI, head; while(!Q1.empty ()) {Head=Q1.front (); Q1.pop (); if

LIS, longest increment sub-sequence1#include 2#include 3 4 using namespacestd;5 6 intLIS (int* Arr,intLen) {7 if(arr = NULL | | Len 1)return 0;8 intLis[len] = {0};9 intMlen =0;Ten for(intI=0; i) { OneLis[i] =1; A for(intj =0; J ) { - if(Arr[j] 1) { -Lis[i] = Lis[j] +1; the } - } - if(Lis[i] >Mlen) { -Mlen =Lis[i]; + } - } + returnMlen; A } at - - intMain () { - intArr[] = {1, -1,2, -3,4, -5,6, -7}; - intL

the composition of the subsequence is not a simple ' piecemeal ', but a sub-sequence of records that are separated by an ' increment '. classProgram {//Hill Sort Algorithm Static voidMain (string[] args) {Shellsorter s=NewShellsorter (); int[] List = { A, $, -, +,5, $, -, About, the, A, -}; S.sort (list); foreach(varIteminchlist) {Console.WriteLine (item); } console.readkey (); } }Set up the Shellsorter class Public classShellsorter { Public voidSort (

, plus the N/2-down adjustment of the previous build heap, and the complexity of each adjustment is O (logn). Two operation times added or O (N * logn). Therefore, the time complexity of heap sequencing is O (N * logn). STL also implements the related functions of the heap, and can refer to thefour heap heap of STL series. Note 1 As a data structure, it is best to use classes to encapsulate their data and methods so that they are easy to operate and understandable. In addition, in addition to he

1. Sorting an almost ordered arrayProblem: Given an array of arr, the number of elements is N, and the order of the elements is moved no more than K, where kAnalysis:1. Bubble sort, select sort, quick sort, merge sort, etc. sorting time complexity is independent of the array state.2. Insert sorting complexity O (n*k)3. Improved heap sequencing can be done by O (N*LOGK)Improved heap Ordering:1. Considering that each move does not exceed K, the smallest element is at 0. K in.2. will be 0 ... K to

-1][j-1] + a[i-1][j]Code#include 10. Mantissa FrontThere are n integers, so that they move backward in order of m positions, and the last m number becomes the first number of M."Difficulty factor" ▲▲▲▲AnalysisC language provisions: When declaring an array, the length of the array must be constant, but the GCC compiler allows the declaration of the array with variables, but before declaring the array the variable must be assigned and once declared, the length of the array cannot be changed, and t

the Golden Section, refers to a sequence of numbers:1,1,2,3,5,8,13,、...... This sequence starts with the third item and each item is equal to the sum of the first two items.Funny Bunny questions:In general, after two months of birth, rabbits have the ability to reproduce, a pair of rabbits can produce a pair of rabbits each month. If all the rabbits are not dead, how many pairs of rabbits can be bred in a year?The analysis is as follows:The first month the rabbit has no reproductive abili

/************************************************************************//* Eight after the problem *//************************************************************************/#include Classical backtracking algorithm--eight problems

the S1 of the pointer without backtracking reason, really only this one difficult point. ）Four. Proof of correctness of KMP algorithm(This article does not expand, later understand the words may be here to supplement the missing content, explained in detail why the S1 pointers do not backtrack, why the previous part is not possible to match ...) ）However, simply focusing on "implementation", we simply understand that the next function can easily implement the KMP algorithm (as to why this can b

Title: 10 unequal integers, the 2nd largest number, requires that the array can not be sorted, the design of the algorithm more efficient the better.1#include 2 3 using namespacestd;4 5 intMax_second (int*arr,intN) {6 intMax_first = arr[0], Max_second = arr[0];7 for(intI=1; I ) {8 if(Arr[i] > Max_first) {//when it is greater than the maximum number9Max_second =Max_first;TenMax_first =Arr[i]; One } A Else if(Arr[i] > Max_second) {//when it is less than the maximum

On the Internet to see a method to calculate the date interval, I look very advanced, carefully look at the higher God, very ingenious.Direct Code first.#include Algorithm parsing :The overall idea of the algorithm is to calculate the number of days from the given date to the March 1 of 0, then subtract and get the interval of the number of days.M1 = (Month_start + 9)% 12; Used to determine whether the date is greater than March (February is the identification of a leap year) and is used to reco

, plus the N/2-down adjustment of the previous build heap, and the complexity of each adjustment is O (logn). Two operation times added or O (N * logn). Therefore, the time complexity of heap sequencing is O (N * logn). STL also implements the related functions of the heap, and can refer to thefour heap heap of STL series. Note 1 As a data structure, it is best to use classes to encapsulate their data and methods so that they are easy to operate and understandable. In addition, in addition to he

The tutorial introduces the method of making classical writing. The general process: the first is the choice of words, with China's more distinctive characteristics of paper-cut character modelling. Then is the arts and textures part of the rendering, texture can be based on the characteristics of the dragon of the Dragon scale pattern. The last is a decent production, similar to other stereo words. Triple recommended: photoshop7.0 Mini version free

The mouse paints a very beautiful classical illustration tattoo The effect picture looks very fine, the personage and the background and so on all depict very beautifully. And the theme of the picture is outstanding, the artistic conception is also very profound. This is a very rare master works. The author of the mouse painting process is also written in great detail, worth learning.Final effect1, line draft.I like the use of the Sai pencil drawing

Photoshop makes Chinese style classical garden characters This tutorial is mainly aimed at how to create a photo atmosphere, using the simplest brush tools to achieve the atmosphere of the scene, learn to control the light and shade of photos, the following is a simple few steps. Original Final effect 1. Use a brush to handle the face simply, facial treatment methods can be referred to 蝈 before, because the cause of the lac

The tutorial introduces the method of the high difficulty people to draw the effect of the mouse. The author is a mouse-painting Super master, so he brought us a little different method of hand-painting. The author's more pay attention to Yu Ming painting, the character's facial features and clothing and so on need to draw out their own slowly, need a longer process: from synthesis, portray details, color and so on, the production must have patience. Earlier can refer to some