/explore
|
You are here 
|
techsavvypriya.wordpress.com | ||
| | | | |
developerlife.com
This tutorial is part of a collection of tutorials on basic data structures and algorithms that are created using Kotlin. This project is useful if you are trying to get more fluency in Kotlin or need a refresher to do interview prep for software engineering roles. |
|
| | | | | ||
| | | | |
adrianmejia.com
JavaScript tutorials and web development articles including topics like NodeJS, Angular, VueJS, Data Structures and Algorithms. |
|
| | | | | ||
| | | | |
imran-khan.com
Binary Search Tree Today I wanted to talk about Binary Search Tree (BST). Basically, a binary search tree is a data structure used in computer science for organizing and storing data in a sorted manner. If you think of a tree, it has many branches. One branch leads to another branch, and that branch splits into others. The same concept applies to a binary search tree. In a BST, each node has at most two children, referred to as the left child and the right child. |
|
| | | | | ||
| | | | |
www.oranlooney.com
A common example of recursion is the function to calculate the \(n\)-th Fibonacci number: def naive_fib(n): if n < 2: return n else: return naive_fib(n-1) + naive_fib(n-2) This follows the mathematical definition very closely but it's performance is terrible: roughly \(\mathcal{O}(2^n)\). This is commonly patched up with dynamic programming. Specifically, either the memoization: from functools import lru_cache @lru_cache(100) def memoized_fib(n): if n < 2: return n else: return memoized_fib(n-1) + memoiz... |
|
| | | |||
