gdgt course review

First, the recursive equationAccording to the idea of divide and conquer, a recursive complexity can be written as a recursive equation.First, the solution of the recursive equation--guess and then proveThis method is also referred to as the surrogate method, the steps are as follows:1, the form of the Guess solution2. Mathematical inductive method proves correctExample:We assume that there is a recursive formula like this:We guess that the solution is T (n) =o (NLGN), and then the recursive sub

test it, after the teaching assistant, know that unit testing is testing software. This lesson taught us a lot about the template of unit test, very practical, still vivid in the present.After a semester of cognition, probably understand the TA is a serious work, high efficiency, dedication, meticulous, knowledgeable and more knowledge ... of people. I am very happy to be able to study with the help of the people with positive energy, thank you, really thank you.Just a few lines of text is not

[Course design] Sprint Review and Summary comments Team contributionFirst, review and summary(1) ReviewBurndown Chart:Sprint Plan-Flowchart:Milestones completed as follows:(2) SummaryAfter another round of new sprint, we finally completed this stage needs to complete the task, unknowingly has experienced two stages of the task sprint, team members from the begi

First, review and summary(1) ReviewBurndown Chart:Sprint Plan-Flowchart:Milestones completed as follows:(2) SummaryThis course design to formally end here, one months, teamwork is very tacit understanding, help each other, can complete the task on time, so that the project can be completed within the stipulated time. In this course design, self-study to a lot of

The score of the Master of Engineering at Jiaotong University is over. Let's celebrate it first. However, it is not a few days before the review. This is a professional course for the university. I will review a course every day. Start with the computer composition principle. Focus The history of computer develop

visionary and well-developed, and make the project reusable and readable, meaning that by learning a higher level of abstraction to complete the project's architecture and software design, It will take some time at the beginning of the project, but it will do more with less.Say to the teacherAdmittedly, the course of software engineering is an unforgettable learning process, and teachers have set themselves up as an example of a complete "engineering

example, when two graphs are stitched together, the boundary line and type are compatible. Consistency (consistency): the degree of uniformity in the expression of the same or similar phenomenon. Completeness (completeness) Availability (Accessibility): Refers to the ease with which data is acquired or used. Current issues (timeliness): The index reflects the extent of the current state of the objective phenomenon. Structural transformations (lots of computer graphi

One, several kinds of comparative complexity of symbolsThe data structure has the description, the related strict mathematics definition also does not want to say, just so over.Several solutions to the maximal sub-arraysTransition from the most complex brute force solution to the simplest dynamic programmingParse and code see here: http://www.cnblogs.com/likaiming/p/8570205.htmlThree, job scheduling problemsThe following dynamic programming and greedy algorithms will give answers, and there's no

3.1 algorithm Complexity of Time Complexity of space In RAM, the time complexity is measured by the number of simple operations performed in RAM, and the spatial complexity is measured using the number of registers in RAM. Thus, the performance analysis of the algorithm becomes a counting problem. Because RAM is abstract, our metrics are machine-independent and language-independent.3.2 Worst case complexityWorst-case complexity means the worst input for the complexityExample:I

Specified counting problems are solved by establishing a Bijection Between the set to be counted and some easy-to-count set. This kind of proofs are usually called (non-rigorously)Combinatorial proofs. The numberK-CompositionsNIs equal to the number of solutions to inPositiveIntegers. Count the number of solutions to inNonnegativeIntegers we call such a solutionWeakK-CompositionOfN. Formally, A MultisetMOn a setSIs a function. For any element, the integer is the number of repetitionsXInM, Call

The static keyword in the OC syntax cannot be decorated with attributes, nor can it be decorated with methods, only local variables in the method. Static modifies a local variable and then changes the local variable to a static variable. This variable is not recycled when the method is executed. This variable is still in place the next time you execute this method.Self is a pointer, and in the object method, self points to the current object. Therefore, you can use self to explicitly access the