thinkphp/lis
Longest Increasing Subsequence. Time Complexity O(N^2) with DP O(N log N) with BS. infoarena
Public GitHub Catalog
Discovered Oct 2, 2026
thinkphp / computer-science-in-c
Computer Science in C / C++
About this discovery
This repository is cataloged as part of our automated global GitHub synchronization. Full telemetry, velocity snapshots, and code summaries are scheduled for continuous enrichment.
#23139753GitHub System ID
thinkphpOrganization / User
PublicVisibility
ActiveCatalog Status
More from thinkphp
thinkphp/binary-search-tree.js
Implementation Binary Search Tree in MooTools 1.5.1
thinkphp/evalexp
Eval Exp. https://ideone.com/0zIgnx . infoarena
thinkphp/rabin-miller
Miller-Rabin Probabilistic Primality Test based on Fermat's little theorem.