XOR Linked List
Versandkostenfrei!
Versandfertig in 6-10 Tagen
29,99 €
inkl. MwSt.
PAYBACK Punkte
15 °P sammeln!
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. XOR linked lists are a data structure used in computer programming. They take advantage of the bitwise exclusive disjunction (XOR) operation, here denoted by , to decrease storage requirements for doubly-linked lists. When you traverse the list from left to right: supposing you are at C, you can take the address of the previous item, B, and XOR it with the value in the link field (B D). You will then have the address for D and you can continue traversing the list. The...
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. XOR linked lists are a data structure used in computer programming. They take advantage of the bitwise exclusive disjunction (XOR) operation, here denoted by , to decrease storage requirements for doubly-linked lists. When you traverse the list from left to right: supposing you are at C, you can take the address of the previous item, B, and XOR it with the value in the link field (B D). You will then have the address for D and you can continue traversing the list. The same pattern applies in the other direction. To start traversing the list in either direction from some point, you need the address of two consecutive items, not just one. If the addresses of the two consecutive items are reversed, you will end up traversing the list in the opposite direction.
Andere Kunden interessierten sich für
