id int64 0 25.6k | text stringlengths 0 4.59k |
|---|---|
23,300 | programminga general overview clearlyn is larger than pk soby assumptionn is not prime howevernone of pk divides exactlybecause there will always be remainder of this is contradictionbecause every number is either prime or product of primes hencethe original assumptionthat pk is the largest primeis falsewhich implies t... |
23,301 | there are several important and possibly confusing points about recursion common question isisn' this just circular logicthe answer is that although we are defining function in terms of itselfwe are not defining particular instance of the function in terms of itself in other wordsevaluating ( by computing ( would be ci... |
23,302 | programminga general overview throughout this bookwe will use recursion to solve problems as an example of nonmathematical useconsider large dictionary words in dictionaries are defined in terms of other words when we look up wordwe might not always understand the definitionso we might have to look up words in the defi... |
23,303 | recursion and induction let us prove (somewhatrigorously that the recursive number-printing program works to do sowe'll use proof by induction theorem the recursive number-printing algorithm is correct for > proof (by induction on the number of digits in nfirstif has one digitthen the program is trivially correctsince ... |
23,304 | programminga general overview the fourth rulewhich will be justified (along with its nicknamein later sectionsis the reason that it is generally bad idea to use recursion to evaluate simple mathematical functionssuch as the fibonacci numbers as long as you keep these rules in mindrecursive programming should be straigh... |
23,305 | /* class for simulating an integer memory cell *class intcell public/*construct the intcell initial value is *intcellstoredvalue /*construct the intcell initial value is initialvalue *intcellint initialvalue storedvalue initialvalue/*return the stored value *int readreturn storedvalue/*change the stored value to *void ... |
23,306 | programminga general overview constructorwhich is implied because the one-parameter constructor says that initialvalue is optional the default value of signifies that is used if no parameter is provided default parameters can be used in any functionbut they are most commonly used in constructors initialization list the... |
23,307 | explicit constructor the intcell constructor is explicit you should make all one-parameter constructors explicit to avoid behind-the-scenes type conversions otherwisethere are somewhat lenient rules that will allow type conversions without explicit casting operations usuallythis is unwanted behavior that destroys stron... |
23,308 | programminga general overview is marked as an accessor but has an implementation that changes the value of any data membera compiler error is generated separation of interface and implementation the class in figure contains all the correct syntactic constructs howeverin +it is more common to separate the class interfac... |
23,309 | #include "intcell /*construct the intcell with initialvalue *intcell::intcellint initialvalue storedvalueinitialvalue /*return the stored value *int intcell::readconst return storedvalue/*store *void intcell::writeint storedvalue xfigure intcell class implementation in file intcell cpp #include #include "intcell husing... |
23,310 | programminga general overview tests whether the symbol is undefined if sowe can process the file otherwisewe do not process the file (by skipping to the #endif)because we know that we have already read the file scope resolution operator in the implementation filewhich typically ends in cppccor ceach member function mus... |
23,311 | #include #include using namespace stdint mainvector squares )forint squares size)++ squaresi iforint squares size)++ cout < <<squaresi <endlreturn figure using the vector classstores squares and outputs them vector and string the +standard defines two classesthe vector and string vector is intended to replace the built... |
23,312 | programminga general overview vector daysinmonth )/no {before ++ daysinmonth daysinmonth daysinmonth daysinmonth daysinmonth daysinmonth daysinmonth daysinmonth daysinmonth daysinmonth daysinmonth daysinmonth certainly this leaves something to be desired ++ fixes this problem and allowsvector daysinmonth }requiring the... |
23,313 | the range for loop is appropriate only if every item is being accessed sequentially and only if the index is not needed thusin figure the two loops cannot be rewritten as range for loopsbecause the index is also being used for other purposes the range for loop as shown so far allows only the viewing of itemschanging th... |
23,314 | programminga general overview is uninitialized at this point in ++no such check is performed to verify that is assigned value prior to being used (howeverseveral vendors make products that do additional checksincluding this onethe use of uninitialized pointers typically crashes programsbecause they result in access of ... |
23,315 | address-of operator (&one important operator is the address-of operator this operator returns the memory location where an object resides and is useful for implementing an alias test that is discussed in section lvaluesrvaluesand references in addition to pointer typesc+defines reference types one of the major changes ... |
23,316 | programminga general overview in ++ an lvalue reference is declared by placing an after some type an lvalue reference then becomes synonym ( another namefor the object it references for instancestring str "hell"string rstr str/rstr is another name for str rstr +' '/changes str to "hellobool cond (&str =&rstr)/truestr a... |
23,317 | but of coursea range for loop would be more elegant unfortunatelythe natural code does not workbecause assumes copy of each value in the vector forauto arr ++ /broken what we really want is for to be another name for each value in the vectorwhich is easy to do if is referenceforauto arr /works ++xlvalue references use ... |
23,318 | programminga general overview to see the reasons why call-by-value is not sufficient as the only parameter-passing mechanism in ++consider the three function declarations belowdouble averagedouble adouble )/returns average of and void swapdouble adouble )/swaps and bwrong parameter types string randomitemvector arr )/r... |
23,319 | if the formal parameter should be able to change the value of the actual argumentthen you must use call-by-reference otherwisethe value of the actual argument cannot be changed by the formal parameter if the type is primitive typeuse call-by-value otherwisethe type is class type and is generally passed using call-by-co... |
23,320 | programminga general overview vector veclargetype item randomitem vec )largetype item randomitem vec )const largetype item randomitem vec )largetype randomitem const vector arr return arrrandomint arr size ]const largetype randomitem const vector arr return arrrandomint arr size ]/copy /copy /no copy figure two version... |
23,321 | vector partialsumconst vector arr vector resultarr size)result arr ]forint arr size)++ resulti resulti arri ]return resultvector vecvector sums partialsumvec )/copy in old ++move in ++ figure returning of stack-allocated rvalue in ++ in addition to the return-by-value and return-by-constant-reference idiomsfunctions ca... |
23,322 | programminga general overview void swapdouble xdouble double tmp xx yy tmpvoid swapvector xvector vector tmp xx yy tmpfigure swapping by three copies void swapvector xvector vector tmp static_cast &&> ) static_cast &&> ) static_cast &&>tmp )void swapvector xvector vector tmp std::movex ) std::movey ) std::movetmp )figu... |
23,323 | acquired during the use of the object this includes calling delete for any corresponding newsclosing any files that were openedand so on the default simply applies the destructor on each data member copy constructor and move constructor there are two special constructors that are required to construct new objectinitial... |
23,324 | programminga general overview the main problem occurs in class that contains data member that is pointer we will describe the problem and solutions in detail in for nowwe can sketch the problem suppose the class contains single data member that is pointer this pointer points at dynamically allocated object the default ... |
23,325 | if the defaults make sense in the routines we writewe will always accept them howeverif the defaults do not make sensewe will need to implement the destructorcopy-and-move constructorsand copy-and-move assignment operators when the default does not workthe copy assignment operator can generally be implemented by creati... |
23,326 | programminga general overview int fintcell }intcell aintcell cc ba write )cout < read<endl < read<endl < read<endlreturn figure simple function that exposes problems in figure the copy assignment operator at lines - uses standard idiom of checking for aliasing at line ( self-assignmentin which the client is making call... |
23,327 | class intcell publicexplicit intcellint initialvalue storedvalue new intinitialvalue }~intcelldelete storedvalue/destructor intcellconst intcell rhs storedvalue new int*rhs storedvalue }/copy constructor intcellintcell &rhs storedvaluerhs storedvalue rhs storedvalue nullptr/move constructor intcell operatorconst intcel... |
23,328 | programminga general overview arr is actually pointer to memory that is large enough to store intsrather than first-class array type applying to arrays is thus an attempt to copy two pointer values rather than the entire arrayand with the declaration aboveit is illegalbecause arr is constant pointer when arr is passed ... |
23,329 | in this sectionwe will describe how type-independent algorithms (also known as generic algorithmsare written in +using the template we begin by discussing function templates then we examine class templates function templates function templates are generally very easy to write function template is not an actual function... |
23,330 | programminga general overview int mainvector )vector )vector )vector )/additional code to fill in the vectors not shown cout <findmaxv <endlcout <findmaxv <endlcout <findmaxv <endlcout <findmaxv <endl/okcomparable int /okcomparable double /okcomparable string /illegaloperatorundefined return figure using findmax functi... |
23,331 | int mainmemorycell memorycell "hello} write ) writem read"world)cout < read<end < read<end return figure program that uses memorycell class template objectprovided that object has zero-parameter constructora copy constructorand copy assignment operator notice that object is passed by constant reference alsonotice that ... |
23,332 | programminga general overview class square publicexplicit squaredouble sides double getsideconst return sidedouble getareaconst return side sidedouble getperimeterconst return sidevoid printostream out cout const out <"(square <getside<")"bool operatorconst square rhs const return getsiderhs getside)privatedouble side}... |
23,333 | figure shows minimal implementation and also illustrates the widely used idiom for providing an output function for new class type the idiom is to provide public member functionnamed printthat takes an ostream as parameter that public member function can then be called by globalnonclass functionoperator<<that accepts a... |
23,334 | programminga general overview /generic findmaxwith function objectversion # /preconditiona size template const object findmaxconst vector arrcomparator cmp int maxindex forint arr size)++ ifcmp islessthanarrmaxindex ]arri maxindex ireturn arrmaxindex ]class caseinsensitivecompare publicbool islessthanconst string lhsco... |
23,335 | /generic findmaxwith function objectc+style /preconditiona size template const object findmaxconst vector arrcomparator islessthan int maxindex forint arr size)++ ifislessthanarrmaxindex ]arri maxindex ireturn arrmaxindex ]/generic findmaxusing default ordering #include template const object findmaxconst vector arr ret... |
23,336 | programminga general overview separate compilation of class templates like regular classesclass templates can be implemented either entirely in their declarationsor we can separate the interface from the implementation howevercompiler support for separate compilation of templates historically has been weak and platform... |
23,337 | #ifndef matrix_h #define matrix_h #include using namespace stdtemplate class matrix publicmatrixint rowsint cols arrayrows forauto thisrow array thisrow resizecols )matrixvectorv arrayv matrixvector& arraystd::movev const vector operator[]int row const return arrayrow ]vector operator[]int row return arrayrow ]int numr... |
23,338 | programminga general overview we now know that operator[should return an entity of type vector should we use return-by-valuereturn-by-referenceor return-by-constant-referenceimmediately we eliminate return-by-valuebecause the returned entity is large but guaranteed to exist after the call thuswe are down to return-by-r... |
23,339 | write function to output an arbitrary double number (which might be negativeusing only printdigit for / +allows statements of the form #include filename which reads filename and inserts its contents in place of the include statement include statements may be nestedin other wordsthe file filename may itself contain an i... |
23,340 | programminga general overview design class templatecollectionthat stores collection of objects (in an array)along with the current size of the collection provide public functions isemptymakeemptyinsertremoveand contains contains(xreturns true if and only if an object that is equal to is present in the collection design... |
23,341 | kernighan and plaugerthe elements of programming style ed mcgraw-hillnew york knuththe art of computer programmingvol fundamental algorithms ed addison-wesleyreadingmass lippmanj lajoieand mooc+primer th ed pearsonbostonmass meyers specific ways to improve your programs and designs ed addison-wesleybostonmass meyersmor... |
23,342 | |
23,343 | algorithm analysis an algorithm is clearly specified set of simple instructions to be followed to solve problem once an algorithm is given for problem and decided (somehowto be correctan important step is to determine how much in the way of resourcessuch as time or spacethe algorithm will require an algorithm that solv... |
23,344 | algorithm analysis the idea of these definitions is to establish relative order among functions given two functionsthere are usually points where one function is smaller than the other so it does not make sense to claimfor instancef(ng(nthuswe compare their relative rates of growth when we apply this to the analysis of... |
23,345 | function name log log log constant logarithmic log-squared linear quadratic cubic exponential figure typical growth rates rule logk (nfor any constant this tells us that logarithms grow very slowly this information is sufficient to arrange most of the common functions by growth rate (see fig several points are in order... |
23,346 | algorithm analysis as an example of the typical kinds of analyses that are performedconsider the problem of downloading file over the internet suppose there is an initial -sec delay (to set up connection)after which the download proceeds at (bytes)/sec then it follows that if the file is megabytesthe time to download i... |
23,347 | occasionallythe best-case performance of an algorithm is analyzed howeverthis is often of little interestbecause it does not represent typical behavior average-case performance often reflects typical behaviorwhile worst-case performance represents guarantee for performance on any possible input notice also thatalthough... |
23,348 | algorithm analysis expectedit might be silly to expend great deal of effort to design clever algorithm on the other handthere is large market these days for rewriting programs that were written five years ago based on no-longer-valid assumption of small input size these programs are now too slow because they used poor ... |
23,349 | running time linear ( log quadratic cubic input size (nfigure plot ( vs timeof various algorithms growth rates are still evident although the graph for the ( log nseems linearit is easy to verify that it is not by using straightedge (or piece of paperalthough the graph for the (nalgorithm seems constantthis is only bec... |
23,350 | algorithm analysis simple example here is simple program fragment to calculate = int sumint int partialsum partialsum forint < ++ partialsum + ireturn partialsumthe analysis of this fragment is simple the declarations count for no time lines and count for one unit each line counts for four units per time executed (tw... |
23,351 | as an examplethe following program fragmentwhich has (nwork followed by ( workis also ( )fori ++ ai fori ++ forj ++ ai +aj jrule --if/else for the fragment ifcondition else the running time of an if/else statement is never more than the running time of the test plus the larger of the running times of and clearlythis ca... |
23,352 | algorithm analysis is terribly inefficient the analysis is fairly simple let (nbe the running time for the function call fib(nif or then the running time is some constant valuewhich is the time to do the test at line and return we can say that ( ( because constants do not matter the running time for other values of is ... |
23,353 | /*cubic maximum contiguous subsequence sum algorithm *int maxsubsum const vector int maxsum forint size)++ forint ij size)++ int thissum forint ik < ++ thissum +ak ]ifthissum maxsum maxsum thissumreturn maxsumfigure algorithm it turns out that more precise analysistaking into account the actual size of these loopsshows... |
23,354 | algorithm analysis - = ( )( ( )( = ( = = = ( )( ( nn we can avoid the cubic running time by removing for loop this is not always possiblebut in this case there are an awful lot of unnecessary computations present in the algorithm the inefficiency that the improved algorithm corrects can be seen by noticing - that =... |
23,355 | which are then solved recursively this is the "dividepart the "conquerstage consists of patching together the two solutions of the subproblemsand possibly doing small amount of additional workto arrive at solution for the whole problem in our casethe maximum subsequence sum can be in one of three places either it occur... |
23,356 | algorithm analysis /*recursive maximum contiguous subsequence sum algorithm finds maximum sum in subarray spanning [left rightdoes not attempt to maintain actual best sequence *int maxsumrecconst vector aint leftint right ifleft =right /base case ifaleft return aleft ]else return int center left right int maxleftsum ma... |
23,357 | program must perform two recursive callsthe two for loops between lines and and some small amount of bookkeepingsuch as lines and the two for loops combine to touch every element in the subarrayand there is constant work inside the loopsso the time expended in lines to is (nthe code in lines to and is all constant amou... |
23,358 | algorithm analysis /*linear-time maximum contiguous subsequence sum algorithm *int maxsubsum const vector int maxsum thissum forint size)++ thissum +aj ]ifthissum maxsum maxsum thissumelse ifthissum thissum return maxsumfigure algorithm than the sketch aboveare almost always requiredeven thenmany people still are not c... |
23,359 | it should be obvious that only special kinds of problems can be (log nfor instanceif the input is list of numbersan algorithm must take (nmerely to read the input in thuswhen we talk about (log nalgorithms for these kinds of problemswe usually presume that the input is preread we provide three examples of logarithmic b... |
23,360 | algorithm analysis clearlyall the work done inside the loop takes ( per iterationso the analysis requires determining the number of times around the loop the loop starts with high low and finishes with high low >- every time through the loopthe value high low must be at least halved from its previous valuethusthe numbe... |
23,361 | since we see that the remainder went from to only in the example indeedthe remainder does not decrease by constant factor in one iteration howeverwe can prove that after two iterationsthe remainder is at most half of its original value this would show that the number of iterations is at most log (log nand establish the... |
23,362 | algorithm analysis long long powlong-long xint ifn = return ifn = return xifisevenn return powx xn )else return powx xn xfigure efficient exponentiation without affecting the correctness of the program indeedthe program will still run in (log )because the sequence of multiplications is the same as before howeverall of ... |
23,363 | which requires about lines of code the analysis of shellsort is still not completeand the disjoint set algorithm has an analysis that until recently was extremely difficult and require pages and pages of intricate calculations most of the analyses that we will encounter here will be simple and involve counting through ... |
23,364 | algorithm analysis ( ( ( ( ( ( sum fori ++ ++sumsum fori ++ forj ++ ++sumsum fori ++ forj ++ ++sumsum fori ++ forj ++ ++sumsum fori ++ forj ++ fork ++ ++sumsum fori ++ forj ++ ifj = fork ++ ++sumsuppose you need to generate random permutation of the first integers for example{ and { are legal permutationsbut { is notbe... |
23,365 | give as accurate (big-ohan analysis as you can of the expected running time of each algorithm write (separateprograms to execute each algorithm timesto get good average run program ( for , , program ( for , , , , , , and program ( for , , , , , , , , , , compare your analysis with the actual running times what is the w... |
23,366 | algorithm analysis give an efficient algorithm to determine if there exists an integer such that ai in an array of integers an what is the running time of your algorithm write an alternative gcd algorithm based on the following observations (arrange so that ) gcd(ab gcd( / / if and are both even gcd(abgcd( / bif is eve... |
23,367 | which program has the better guarantee on the running time for large values of ( , ) which program has the better guarantee on the running time for small values of ( ) which program will run faster on average for , is it possible that program will run faster than program on all possible inputsa majority element in an a... |
23,368 | in terms of and cwhich are the number of rows and columns in the puzzleand wwhich is the number of wordswhat are the running times of the algorithms described in suppose the word list is presorted show how to use binary search to obtain an algorithm with significantly better running time suppose that line in the binary... |
23,369 | listsstacksand queues this discusses three of the most simple and basic data structures virtually every significant program will use at least one of these structures explicitlyand stack is always implicitly used in programwhether or not you declare one among the highlights of this we will introduce the concept of abstr... |
23,370 | listsstacksand queues if they are done correctlythe programs that use them will not necessarily need to know which implementation was used the list adt we will deal with general list of the form an- we say that the size of this list is we will call the special list of size an empty list for any list except the empty li... |
23,371 | there are many situations where the list is built up by insertions at the high endand then only array accesses ( findkth operationsoccur in such casethe array is suitable implementation howeverif insertions and deletions occur throughout the list andin particularat the front of the listthen the array is not good option... |
23,372 | listsstacksand queues figure insertion into linked list first last figure doubly linked list the special case of adding at the end ( making the new item the last itemcan be constant-timeas long as we maintain link to the last node thusa typical linked list keeps links to both ends of the list removing the last item is ... |
23,373 | list is that insertion of new items and removal of existing items is cheapprovided that the position of the changes is known the disadvantage is that the list is not easily indexable both vector and list are inefficient for searches throughout this discussionlist refers to the doubly linked list in the stlwhereas list ... |
23,374 | listsstacksand queues iterators some operations on listsmost critically those to insert and remove from the middle of the listrequire the notion of position in the stla position is represented by nested typeiterator in particularfor listthe position is represented by the type list::iteratorfor vectorthe position is rep... |
23,375 | *itrreturns reference to the object stored at iterator itr' location the reference returned may or may not be modifiable (we discuss these details shortlyr itr ==itr returns true if iterators itr and itr refer to the same location and false otherwise itr !=itr returns true if iterators itr and itr refer to different lo... |
23,376 | listsstacksand queues template void removeeveryotheritemcontainer lst auto itr lst begin)/itr is container::iterator whileitr !lst enditr lst eraseitr )ifitr !lst end++itrfigure using iterators to remove every other item in list (either vector or listefficient for listbut not for vector timing information the function ... |
23,377 | void printconst list lstostream out cout typename container::iterator itr lst begin)whileitr !lst endout <*itr <endl*itr /this is fishy!!++itrif this code were legalthen the const-ness of the list would be completely meaninglessbecause it would be so easily bypassed the code is not legal and will not compile the soluti... |
23,378 | listsstacksand queues template void printconst container costream out cout ifc emptyout <"(empty)"else auto itr beginc )/itr is container::const_iterator out <"<*itr++/print first item whileitr !endc out <"<*itr++out <]<endlfigure printing any container non-member functions the addition of begin and end as free functio... |
23,379 | the array is simply pointer variable to block of memorythe actual array size must be maintained separately by the programmer the block of memory can be allocated via new[but then must be freed via delete[ the block of memory cannot be resized (but newpresumably larger block can be obtained and initialized with the old ... |
23,380 | listsstacksand queues #include template class vector publicexplicit vectorint initsize thesizeinitsize }thecapacityinitsize spare_capacity objects new objectthecapacity ]vectorconst vector rhs thesizerhs thesize }thecapacityrhs thecapacity }objectsnullptr objects new objectthecapacity ]forint thesize++ objectsk rhs obj... |
23,381 | void resizeint newsize ifnewsize thecapacity reservenewsize )thesize newsizevoid reserveint newcapacity ifnewcapacity thesize returnobject *newarray new objectnewcapacity ]forint thesize++ newarrayk std::moveobjectsk )thecapacity newcapacitystd::swapobjectsnewarray )delete newarrayfigure (continuedthe resize routine is... |
23,382 | listsstacksand queues object operator[]int index return objectsindex ]const object operator[]int index const return objectsindex ]bool emptyconst return size= int sizeconst return thesizeint capacityconst return thecapacityvoid push_backconst object ifthesize =thecapacity reserve thecapacity )objectsthesize+xvoid push_... |
23,383 | iterator endreturn &objectssize]const_iterator endconst return &objectssize]static const int spare_capacity privateint thesizeint thecapacityobject objects}figure (continuedfinallyat lines to we see the declaration of the iterator and const_iterator nested types and the two begin and two end methods this code makes use... |
23,384 | listsstacksand queues in considering the designwe will need to provide four classes the list class itselfwhich contains links to both endsthe size of the listand host of methods the node classwhich is likely to be private nested class node contains the data and pointers to the previous and next nodesalong with appropri... |
23,385 | head tail figure an empty doubly linked list with header and tail nodes keyword is not neededbut you will often see it and it is commonly used by programmers to signify type that contains mostly data that are accessed directlyrather than through methods in our casemaking the members public in the node class will not be... |
23,386 | template class list privatestruct node /see figure *}publicclass const_iterator /see figure *}class iterator public const_iterator /see figure *}publiclist/see figure *listconst list rhs /see figure *~list/see figure *list operatorconst list rhs /see figure *listlist &rhs /see figure *list operatorlist &rhs /see figure... |
23,387 | object frontreturn *begin)const object frontconst return *begin)object backreturn *--end)const object backconst return *--end)void push_frontconst object insertbegin) )void push_frontobject & insertbegin)std::movex )void push_backconst object insertend) )void push_backobject & insertend)std::movex )void pop_fronteraseb... |
23,388 | listsstacksand queues struct node object datanode *prevnode *nextnodeconst object object}node nullptrnode nullptr datad }prevp }nextn nodeobject &dnode nullptrnode nullptr datastd::moved }prevp }nextn }figure nested node class for list class howeverin our casewe can avoid much of the syntactical baggage because we are ... |
23,389 | class const_iterator publicconst_iteratorcurrentnullptr const object operatorconst return retrieve)const_iterator operator+current current->nextreturn *thisconst_iterator operator+int const_iterator old *this++*this )return oldbool operator=const const_iterator rhs const return current =rhs currentbool operator!const c... |
23,390 | listsstacksand queues class iterator public const_iterator publiciteratorobject operatorreturn const_iterator::retrieve)const object operatorconst return const_iterator::operator*)iterator operator+this->current this->current->nextreturn *thisiterator operator+int iterator old *this++*this )return oldprotectediteratorn... |
23,391 | listinit)~listclear)delete headdelete taillistconst list rhs init)forauto rhs push_backx )list operatorconst list rhs list copy rhsstd::swap*thiscopy )return *thislistlist &rhs thesizerhs thesize }headrhs head }tailrhs tail rhs thesize rhs head nullptrrhs tail nullptrlist operatorlist &rhs std::swapthesizerhs thesize )... |
23,392 | listsstacksand queues prev figure insertion in doubly linked list by getting new node and then changing pointers in the order indicated steps and can be combinedyielding only two linesnode *newnode new nodexp->prevp } ->prev ->prev->next newnode/steps and /steps and but then these two lines can also be combinedyielding... |
23,393 | figure removing node specified by from doubly linked list /erase item at itr iterator eraseiterator itr node * itr currentiterator retvalp->next } ->prev->next ->nextp->next->prev ->prevdelete pthesize--return retvaliterator eraseiterator fromiterator to foriterator itr fromitr !toitr eraseitr )return tofigure erase ro... |
23,394 | listsstacksand queues protectedconst list *thelistnode *currentconst_iteratorconst list lstnode * thelist&lst }currentp void assertisvalidconst ifthelist =nullptr |current =nullptr |current =thelist->head throw iteratoroutofboundsexception}figure revised protected section of const_iterator that incorporates ability to ... |
23,395 | the stack adt stack is list with the restriction that insertions and deletions can be performed in only one positionnamelythe end of the listcalled the top stack model the fundamental operations on stack are pushwhich is equivalent to an insertand popwhich deletes the most recently inserted element the most recently in... |
23,396 | listsstacksand queues implementation of stacks since stack is listany list implementation will do clearly list and vector support stack operations of the time they are the most reasonable choice occasionally it can be faster to design special-purpose implementation because stack operations are constanttime operationsth... |
23,397 | the sequence [()is legalbut [(]is wrong obviouslyit is not worthwhile writing huge program for thisbut it turns out that it is easy to check these things for simplicitywe will just check for balancing of parenthesesbracketsand braces and ignore any other character that appears the simple algorithm uses stack and is as ... |
23,398 | listsstacksand queues two numbers (symbolsthat are popped from the stackand the result is pushed onto the stack for instancethe postfix expression + is evaluated as followsthe first four symbols are placed on the stack the resulting stack is topofstack nexta '+is readso and are popped from the stackand their sum is pus... |
23,399 | nexta '+is seenso and are poppedand is pushed topofstack topofstack now is pushed next'+pops and and pushes topofstack finallya '*is seen and and are poppedthe result is pushed topofstack the time to evaluate postfix expression is ( )because processing each element in the input consists of stack operations and therefor... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.