interview cake data structures

Linked List of data structures and algorithms Classification of linked lists: (1) single-chain table Header insertion: you only need to maintain one header node, which is often used to simulate the stack; Tail insertion: You need to maintain the head and end nodes, which are often used to simulate queues. (2) Two-way linked list Bidirectional traversal can be used to save Web page history; (3) Circular link

, vi belongs to V-S. Then, the shortest path is compared with the source point A to the path length of the node vi, the minimum length is the shortest path from source point A to Node VI. Finally, the end of the shortest path (i.e. VI) is added to the S(3) Repeat step (2) until the shortest path of all endpoints is found, that is, the number of nodes in S is equal to the number of nodes in V.The time complexity of the Dijkstra algorithm is O (n^2), the spatial complexity depends on the storage m

. (5) Merge sort can be used to sort within, or can be used for sorting outside. When you sort outside, you usually use a multi-way merge,And by solving the merging of Changshun string, the long initial string is generated, and the parallel capability of the host and peripherals is improved to reduce the number of accesses external memory and improve the efficiency of the external sequencing.2, the search algorithm can be proficient in writing or the computer code out two points to find the prog

point is reachedThe general tree does not ask the most deep is to traverse itThe hierarchical traversal sequence is a good follow-up. If you're going to spend the tree, ask him for a piece of paper. Give him the simplest logic 123456789.But web development is generally not too deep, think more about the technical point of not knowing what to say don't know nothing embarrassing.Well, that's a pretty general idea. I'm going to take the university's algorithm introduction and algorithm 4 out of th

a dead loop. 1 public static void Swap (link list, link element1, link element2) 2 {3 if (list = = NULL | | list.get_nex T () = = NULL | | List.get_next (). Get_next () = = NULL | | 4 Element1 = = NULL | | Element2 = = NULL | | Element1 = = Element2) 5 return; 6 7 Link Pre1 = null, Pre2 = NULL, NEXT1 = NULL, NEXT2 = NULL; 8 Link cur1=element1, Cur2=element2; 9 Link temp = List.get_next (); Boolean bFound1 = false;11 Boolean bFound2 = false;12 whi Le (temp! = null) (Temp.get_ne

Array of data structures and algorithms The basic concept of array: array is the simplest and most commonly used data structure, but there are also some considerations: (1) array allocation method and storage location; (2) initialization; (3) Advanced definition of arrays in different languages; (4) multi-dimensional array; Array allocation method in C/C ++: (1)

whether the string conforms to the palindrome string rules;...... Et cetera (Yes--->true; not---->faulse)2.2 Numeric operations(1) Int and long expressions have a finite range of integers, so large integers are often implemented with strings;(2) The subtraction operation which is related to the large integer needs to simulate the written calculation process;2.3 Types related to array operations(1) array-related adjustment, sequencing and other operations need to master;(2) The division process

);System.out.println ("\ n Sort after:"); for(intElement:array) {System.out.print (element+" "); } }}Sort Result:before sorting:5 3 1 7 2 8 after sorting:Algorithm analysis: 1. When the base element selected by the partition is the maximum or minimum value in the element to be sorted, for the worst case, the time complexity is the same as the direct insertion sort, and the number of moves reaches the maximum valueCmax = 1+2+...+ (n-1) = N (n-1)/2 = O (n2) At this time it is better to have a

List operation code is small but more error-prone, is more suitable for the interview place. Code implementation /** * Source Name: Mylinklist.java * Date: 2014-09-05 * program function: Java list operation * Copyright: [emailprotected] * A2bgeek */import Java.util.Sta Ck;public class Mylinklist {class Linknode"Data structures and Algorithms" Java l

Recently invited to participate in "51CTO interview" even if the law and data structure topic on the answer, I hope these questions can be answered in the minds of your readers ' doubts.The event URL is as follows:Http://book.51cto.com/act/exp/zuofeiHere are some of the activities in the Qa link I have some answers, hope can be used as a learning algorithm for some of the Friends experience reference.