Search
- Filter Results
- Location
- Classification
- Include attachments
- https://eng.libretexts.org/Bookshelves/Computer_Science/Databases_and_Data_Structures/Open_Data_Structures_-_An_Introduction_(Morin)/13%3A_Data_Structures_for_Integers/13.02%3A_XFastTrie_-_Searching_in_Doubly-Logarithmic_TimeFor an example, refer to Figure \(\PageIndex{1}\); in this figure the last node, \(\mathtt{u}\), on search path for 14 (whose binary representation is 1110) is the node labelled \(11{\star\star}\) at ...For an example, refer to Figure \(\PageIndex{1}\); in this figure the last node, \(\mathtt{u}\), on search path for 14 (whose binary representation is 1110) is the node labelled \(11{\star\star}\) at level 2 because there is no node labelled \(111{\star}\) at level 3. Then, the node \(\mathtt{u}\) we are searching for would be at or below level \(\mathtt{i}\) if and only if there is a node at level \(\mathtt{i}\) whose label matches the highest-order \(\mathtt{i}\) bits of \(\mathtt{x}\).
- https://eng.libretexts.org/Bookshelves/Computer_Science/Programming_and_Computation_Fundamentals/Algorithm_Design_and_Analysis_(Justo)/02%3A_Searching_Binary_Search_Trees_and_Heaps/2.01%3A_Activity_1_-_Searching_TechniquesOtherwise, if the item is less than the middle element then it will recursively search on the sub-array to the left of the middle element or if the item is greater it will recursively search on the su...Otherwise, if the item is less than the middle element then it will recursively search on the sub-array to the left of the middle element or if the item is greater it will recursively search on the sub-array to the right of the middle element.
- https://eng.libretexts.org/Courses/Butte_College/Intro_to_Programming_with_Programming_Fundamentals_and_Python_for_Everyone/22%3A_Searching_and_Sorting_Algorithms/22.01%3A_Activity_1_-_Searching_AlgorithmThis activity involves studying the searching process and how to write algorithms that can find a particular given item from a list of given items. The activity of searching will dedicate itself to pr...This activity involves studying the searching process and how to write algorithms that can find a particular given item from a list of given items. The activity of searching will dedicate itself to providing the answer of a presence or no presence of the searched item. The section will dedicate itself to introducing the sequential and binary types of search.
- https://eng.libretexts.org/Bookshelves/Computer_Science/Databases_and_Data_Structures/Open_Data_Structures_-_An_Introduction_(Morin)/14%3A_External_Memory_Searching/14.02%3A_B-TreesTo determine the running time in the word-RAM model, we have to account for the cost of calling \(\mathtt{findIt(a,x)}\) for each node we access, so the running time of \(\mathtt{find(x)}\) in the wor...To determine the running time in the word-RAM model, we have to account for the cost of calling \(\mathtt{findIt(a,x)}\) for each node we access, so the running time of \(\mathtt{find(x)}\) in the word-RAM model is The executive summary of the \(\mathtt{add(x)}\) method is that it walks from the root to a leaf searching for \(\mathtt{x}\), adds \(\mathtt{x}\) to this leaf, and then walks back up to the root, splitting any overfull nodes it encounters along the way.
- https://eng.libretexts.org/Bookshelves/Computer_Science/Databases_and_Data_Structures/Data_Structure_and_Algorithms_(Njoroge)/04%3A_Searching_and_Sorting_Algorithm/4.01%3A_Activity_1_-_Searching_AlgorithmThis activity involves studying the searching process and how to write algorithms that can find a particular given item from a list of given items. The activity of searching will dedicate itself to pr...This activity involves studying the searching process and how to write algorithms that can find a particular given item from a list of given items. The activity of searching will dedicate itself to providing the answer of a presence or no presence of the searched item. The section will dedicate itself to introducing the sequential and binary types of search.
- https://eng.libretexts.org/Bookshelves/Computer_Science/Programming_Languages/Python_Programming_(OpenStax)/16%3A_Answer_Key/16.11%3A_Chapter_12This page explores recursion in problem-solving, illustrating how complex tasks can be broken down into smaller ones. Examples include the Tower of Hanoi, summations, palindromes, Fibonacci calculatio...This page explores recursion in problem-solving, illustrating how complex tasks can be broken down into smaller ones. Examples include the Tower of Hanoi, summations, palindromes, Fibonacci calculations, and the greatest common divisor. It emphasizes the significance of base cases and provides guidance on implementing recursive functions while comparing the efficiency of recursive and iterative solutions in various scenarios.
