[B! algorithm][data structure] kenzan8000のブックマーク

kenzan8000 id:kenzan8000

algorithmとdata structureに関するkenzan8000のブックマーク (58)

Heap Data Structure
kenzan8000 2021/07/24
data structure

algorithm

heap

binary tree
リンク
Meet the Swift Algorithms and Collections packages - WWDC21 - Videos - Apple Developer
kenzan8000 2021/06/10
swift

programming

data structure

algorithm

functional
リンク
Bucket Sort | GeeksforGeeks
kenzan8000 2020/09/03
bucket sort

sort

algorithm

data structure

computer science
リンク
Programming Anime: Floyd's Algorithm Explained
kenzan8000 2020/07/06
floyd's algorithm

data structure

algorithm

math

computer science
リンク
Two Way External Memory Merging
kenzan8000 2020/06/30
external merge sort explained with an example of how the data is stored on fast memory when merging. (https://www.youtube.com/watch?v=5mKtLu60pdw)

sort

external merge sort

data structure

algorithm

computer science
リンク
External Memory Mergesort
kenzan8000 2020/06/30
external merge sort is a merge sort that is used when size of the list you want to sort is too huge for your fast memory to store. The algorithm divides a list into multiple chunks that fit your fast memory and runs merge sort to each.

sort

external merge sort

data structure

algorithm

computer science
リンク
Damn Cool Algorithms: Spatial indexing with Quadtrees and Hilbert Curves - Nick's Blog
Damn Cool Algorithms: Spatial indexing with Quadtrees and Hilbert Curves Posted by Nick Johnson | Filed under tech, coding, damn-cool-algorithms Last Thursday night at Oredev, after the sessions, was "Birds of a Feather" - a sort of mini-unconference. Anyone could write up a topic on the whiteboard; interested individuals added their names, and each group got allocated a room to chat about the top
kenzan8000 2020/06/26
quadtree

geohash

hilbert curves

data structure

algorithm

computer science
リンク
Quadtrees and Octrees for Representing Spatial Information
kenzan8000 2020/06/26
2d space is represented by quadtree which is a search tree that has 4 branches. 3d space is represented by octree which has 8 branches.

tree

quadtree

octree

data structure

algorithm

computer science
リンク
Geohash: Deep Intuitive Understanding in under 7 Minutes
kenzan8000 2020/06/26
geohash is a data structure connecting certain area and hash key. bigger area contain smaller areas. smaller areas' key inherits the parent area's one like the child one is just added one letter from the parent one.

db

geohash

map

algorithm

data structure

computer science
リンク
データベース内部の仕組み
本ガイドについてDataStax Enterpriseデータベースの仕組みに関する開発者および管理者向けの情報。 DataStax Enterprise 5.1 FAQDataStax Enterpriseに関してよく寄せられる質問データベース・アーキテクチャーDataStax Enterpriseデータベースの仕組みを理解するための重要な情報。コンポーネント・アーキテクチャーDSE Analytics、DSE Search、およびDSE Graphの仕組みを理解するための重要な情報。データベース内部の仕組みDataStax Enterpriseデータベースに関する情報。ストレージ・エンジンDataStax Enterpriseストレージ構造およびエンジンについて。読み取りと書き込みについてDataStax Enterpriseデータベースがどのようにデータを格納するかを理解する
kenzan8000 2020/06/19
log structured merge tree is one of the data structure and algorithm used for db. sorted string table: sequential string just added to the disk when storing a new record. compaction: how to merge duplicated old records into one same record.

db

lsm tree

sstable

memtable

bloom filter

tombstone

compaction

data structure

algorithm

computer science
リンク
Residency Match (Stable Marriage Problem, Gale-Shapley Algorithm)
kenzan8000 2020/05/25
Stable marriage problem is an optimal matching problem of two groups. There are two groups A and B. A has the ranked preference order of B. So does B. Firstly, matchings are made by A's preference then if there is duplication, B's preference priority is applied until everyone is matched.

stable marriage problem

gale shapley algorithm

data structure

algorithm

computer science
リンク
Dynamic Programming / Flood Fill Algorithm
kenzan8000 2020/05/24
Flood fill is used for typically finding shortest paths. It is a combination of dynamic programming and breast first search.

flood fill

bfs

backtracking

dynamic programming

data structure

algorithm

computer science
リンク
Community - Competitive Programming - Tutorials
kenzan8000 2020/05/23
data structure

algorithm

computer science

programming
リンク
Advanced Data Structures: Treaps
kenzan8000 2020/05/21
Treap is a data structure that is a combination of binary search tree and heap. e.g. Each node has key and value. Key belongs to BST rule and value belongs to heap rule.

treap

heap

tree

binary tree

search tree

data structure

algorithm

computer science
リンク
Union Find Introduction
kenzan8000 2020/05/20
Union find is an algorithm that makes all independent sets into one union. This implementation is represented by nodes and the network.

union find

disjoint set

data structure

algorithm

computer science
リンク
What is a Bipartite Graph? | Graph Theory
kenzan8000 2020/05/20
Bigraph (aka BIpartite Graph) is a graph that can divide the nodes into two sets the every node edge connects from set A to set B.

bigraph

graph

data structure

algorithm

math

computer science
リンク
Ford-Fulkerson in 5 minutes
kenzan8000 2020/05/19
Ford-Fulkerson is an algorithm that solves network flow problem. Network flow are nodes and edges that connects the nodes. Each edge has the limit how much flow is allowed to run. Network flow problem is to know how much flow can run at the same time from start node to goal node.

ford fulkerson

network flow

data structure

algorithm

computer science

dfs
リンク
Skip List | Set 1 (Introduction) | GeeksforGeeks
kenzan8000 2020/05/18
skip list is a sorted linked list that has multiple layers. e.g. normal lane (original linked list) and express lane (pick up nodes from normal lane and connect them and skip the other nodes between the selected nodes when searching.)

skip list

data structure

algorithm

linked list

computer science
リンク
K-d Tree in Python #3 — Finale
kenzan8000 2020/05/14
k-d tree is a binary search tree that represents the node value as k-dimensional coordinates, and how the left and right branches go depends on the layer of tree (e.g. 1: x, 2: y, 3: z, 4: x, ...). This data structure is typically used for nearest neighbor algorithm.

k-d tree

data structure

algorithm

computer science

binary tree

binary search
リンク
B-Tree Tutorial - An Introduction to B-Trees
kenzan8000 2020/05/12
b-tree (order m) is a balanced search tree that every node has most m children and a non-leaf node with k children contains k-1 keys in the node (can have branch left edge and right edge and positions between the keys. represents keyA < childKeys < keyB). this is typically used for relational db.

b-tree

binary search

binary tee

data structure

algorithm

db

computer science
リンク
1 2 3 次のページ

お知らせ

もっと読む

公式Twitter

@HatenaBookmark
リリース、障害情報などのサービスのお知らせ
@hatebu
最新の人気エントリーの配信

キーボードショートカット一覧

j次のブックマーク

k前のブックマーク

lあとで読む

eコメント一覧を開く

oページを開く

設定を変更しましたx