Search results
Jump to navigation
Jump to search
Page title matches
- #REDIRECT [[List of terms relating to algorithms and data structures]] ...111 bytes (16 words) - 00:21, 9 February 2020
- #REDIRECT [[List of terms relating to algorithms and data structures]] ...70 bytes (10 words) - 17:45, 10 February 2020
- ...d|reason=This list is based on the NIST "Dictionary of Algorithms and Data Structures," which was published online in 1998|date=September 2018}} ...necessarily mentioned here, see [[list of algorithms]] and [[list of data structures]]. ...35 KB (3,524 words) - 18:46, 6 May 2025
Page text matches
- #REDIRECT [[List of terms relating to algorithms and data structures]] ...70 bytes (10 words) - 17:45, 10 February 2020
- #REDIRECT [[List of terms relating to algorithms and data structures]] ...111 bytes (16 words) - 00:21, 9 February 2020
- * [[Analysis of algorithms]] * [[Best and worst cases]] ...1 KB (141 words) - 13:50, 14 September 2024
- ....in/~ssen/csl101/details.html | title = CSL 101: Introduction to Computers and Programming | publisher = IIT Delhi }} ...gp.ac.in/~pds/semester/index05.html | title = CS13002 Programming and Data Structures | publisher = IIT Kharagpur }} ...3 KB (375 words) - 00:08, 5 June 2024
- {{Short description|Mechanism for capturing chronological and causal relationships}} ...two processes never interact, the lack of synchronization is unobservable and in these applications it is enough for the processes to agree on the event ...3 KB (389 words) - 14:14, 15 February 2022
- {{Short description|Process of transforming a static data structure into a dynamic one}} ...ges. Dynamization techniques provide uniform ways of creating dynamic data structures. ...4 KB (628 words) - 21:12, 30 June 2025
- {{About|the data structure|the type of metric space|Real tree}} ...st=Samet|first=Hanan|title=Foundations of multidimensional and metric data structures|year=2006|publisher=Morgan Kaufmann|isbn=978-0-12-369446-1|url=https://book ...4 KB (672 words) - 10:34, 13 June 2025
- {{Short description|Data with an associated thread or process}} ...drews |first1=Gregory R. |last2=Dobkin |first2=David P. |title=Active data structures |conference=5th International Conference on Software Engineering, ICSE 1981 ...3 KB (481 words) - 19:30, 1 May 2024
- ...stitute of Standards and Technology|work=Dictionary of Algorithms and Data Structures|accessdate=2010-01-10}}</ref> ...rithmic function produces a function with [[quasi-polynomial growth]], and algorithms with this as their [[time complexity]] are said to take [[quasi-polynomial ...2 KB (296 words) - 04:27, 15 May 2024
- {{Short description|Class of algorithms}} ...useful for solving many mathematical problems, including [[maze]] problems and many problems in [[graph theory]]. ...2 KB (328 words) - 18:11, 26 January 2025
- ...ith specializations.<ref name="mit-6- 3">{{Cite web|title=Computer Science and Engineering (Course 6-3) < MIT|url=http://catalog.mit.edu/degree-charts/com ...b/20170712105714/http://www.gate.iitg.ac.in:80/Syllabi/CS_Computer-Science-and-Information-Technology.pdf |archive-date=2017-07-12 }}</ref> ...4 KB (452 words) - 16:02, 26 June 2025
- ...evel consists of the program's algorithms, the data structures themselves, and so on. ...1 KB (177 words) - 03:16, 22 March 2023
- {{Short description|Data structure in tree form sorted for fast lookup}} ...h tree"]. [http://xlinux.nist.gov/dads// Dictionary of Algorithms and Data Structures]</ref> ...5 KB (836 words) - 16:22, 6 January 2024
- ...nnot be performed on them, but they are useful in [[computing]] as [[array data structure|array]]s which are called [[jagged array]]s. Irregular matrices a ...d Data Structures]], Paul E. Black, ed., [[National Institute of Standards and Technology|NIST]], 2004. ...1 KB (141 words) - 21:13, 14 April 2025
- *Even and odd permutations—see [[Parity of a permutation]] *[[Cycles and fixed points]] ...4 KB (339 words) - 11:52, 17 July 2024
- ...At the '''knowledge level''', we only need to specify what the agent knows and what its goals are; a logical abstraction separate from details of implemen ...evel consists of the program's algorithms, the data structures themselves, and so on. ...2 KB (218 words) - 16:15, 23 September 2024
- ...cess]], the ability to access an arbitrary element of a sequence as easily and efficiently as any other at any time. ...://technet.microsoft.com/en-us/library/cc938619.aspx Random and Sequential Data Access], Microsoft TechNet</ref> ...4 KB (593 words) - 09:16, 7 February 2025
- {{Short description|Finding and extracting information from semi-structured data sets}} ...l pattern mining]] and [[molecule mining]] are special cases of structured data mining{{Citation needed|date=November 2010}}. ...5 KB (744 words) - 07:07, 16 April 2025
- |data=[[Array data structure|Array]] |time=<math>O(N+n)</math>, where ''N'' is the range of key values and ''n'' is the input size ...4 KB (527 words) - 07:31, 14 October 2025
- |data=[[Array data structure|Array]] ...m's running time is thus slower compared to reasonable sorting algorithms, and is slower than [[bubble sort]], a canonical example of a fairly inefficient ...4 KB (550 words) - 12:51, 22 February 2025