Download presentation
Presentation is loading. Please wait.
1
PARRAY paMake paAdd paRemove paSize paReplace paElementAt paCurrent
ADDRESS VALUE INDEX paMake paAdd paRemove paSize paReplace paElementAt paCurrent paSetCurrent paFirst paLast paNext paPrev … 0x3b355c 0x3b3580 12 elements 0x3b3584 5 1 num_elems (4) 0x3b3588 15 2 curr_size (6) 0x3b358c 7 3 curr struct PArray { int curr_size; int grow_by; int num_elems; void** elements; int curr; }; grow_by (2)
2
STACK stkMake stkPush stkPop stkPeek stpSize … struct Stack
ADDRESS VALUE INDEX seData stTop 0x8535b4 0x8535d8 12 seNext 0x8535dc N/A stTotal (2) seData 0x853600 5 1 seNext 0x853604 0x8535d8 struct Stack { int stTotal; StackElement * stTop; }; struct StackElement { void * seData; StackElement * seNext; }
3
QUEUE qMake qEnque qDeque qLength qCurrent qSetCurrent qFirst qLast
ADDRESS VALUE INDEX qMake qEnque qDeque qLength qCurrent qSetCurrent qFirst qLast qNext qPrev … qeData qHead 0x8535b4 0x8535d8 12 qePrev qTail 0x8535b8 0x8535dc N/A qeNext qCurr 0x8535bc 0x8535e0 0x853600 qTotal (2) qeData 0x853600 5 1 qePrev 0x853604 0x8535d8 qeNext 0x853608 N/A struct Queue { int qTotal; QElem * qHead; QElem * qTail; QElem * qCurr; }; struct QElem { void * qeData; QElem * qePrev; QElem * qeNext; };
Similar presentations
![LCS Non-Dynamic Version int function lcs (x, y, i, j) begin if (i = 0) or (j = 0) return 0; else if (x[i] = y[j]) return lcs(x, y, i-1, j-1)+1; else return.](/12/3359156/big_thumb.jpg "LCS Non-Dynamic Version int function lcs (x, y, i, j) begin if (i = 0) or (j = 0) return 0; else if (x[i] = y[j]) return lcs(x, y, i-1, j-1)+1; else return.>")
