🥕
TIL
Ctrlk
  • [TIL] Studying tech / computer science knowledge
  • KeyMap
  • 알고리즘
    • 복잡도 계산 ( Computational Complexity )
    • DisjointSet-unionFind
    • Bellman-ford Algorithm
    • Dijkstra's Algorithm
    • DP ( Dynamic Programming , 동적 계획법 )
    • 플로이드-워셜 알고리즘 (Floyd-Warshall algorithm)
    • Kruskal's Algorithm
    • 최장 증가 수열 (Longes Increasing Subsequence)
    • Prim's Algorithm
    • 정렬
    • 시간복잡도 와 공간복잡도 ( Time Complexity & Space Complexity )
    • Topological Sort (위상 정렬)
  • 책 읽고난 후 요약
  • CDC
  • 개발 상식
  • 자료구조
  • DevOps
  • Java
  • JavaScript
  • Linux
  • 네트워크
  • PHP
  • React
  • Spring
  • DataBase
  • Web 상식
Powered by GitBook
On this page

알고리즘

복잡도 계산 ( Computational Complexity )DisjointSet-unionFindBellman-ford AlgorithmDijkstra's AlgorithmDP ( Dynamic Programming , 동적 계획법 )플로이드-워셜 알고리즘 (Floyd-Warshall algorithm)Kruskal's Algorithm최장 증가 수열 (Longes Increasing Subsequence)Prim's Algorithm정렬시간복잡도 와 공간복잡도 ( Time Complexity & Space Complexity )Topological Sort (위상 정렬)
PreviousKeyMapNext복잡도 계산 ( Computational Complexity )

Last updated 3 years ago