It's great seeing the algorithms in context.
#Kasauti zindagi ki episode 440 driver#
Bubble sort is amazingly implemented too, in a driver library.Merge sort on linked lists is used for garbage collection, file system management, etc.Breadth first search is used to check correctness of locking at runtime.Depth first search and variant used in directory configuration.Binary search is used for interrupt handling, register cache lookup, etc.Bit arrays, which are used for dealing with flags, interrupts, etc.Hash tables used to implement inodes, file system integrity checks, etc.Some parts of the code, such as this driver, implement their own hash function.Hash functions, with a reference to Knuth and to a paper.Priority heap, which is literally, a textbook implementation, used in the control group system.Radix trees, are used for memory management, NFS related lookups and networking related functionality.Red-Black trees are used are used for scheduling, virtual memory management, to track file descriptors and directory entries, etc.
Priority sorted lists used for mutexes, drivers, etc.B+ Trees with comments telling you what you can't find in the textbooks.Linked lists, doubly linked lists, lock-free linked lists.Thanks to Vijay D'Silva's brilliant answer in I have been reading some of the famous data structures and algorithms used in the Linux Kernel.
0 kommentar(er)
