Strongly Connected Components and Condensation Graphĭijkstra - finding shortest paths from given vertexīellman-Ford - finding shortest paths with negative weightsįloyd-Warshall - finding all shortest paths Half-plane intersection - S&I Algorithm in O(N log N)Ĭonnected components, bridges, articulations points Search for a pair of intersecting segmentsĭelaunay triangulation and Voronoi diagram Pick's Theorem - area of lattice polygons Manacher's Algorithm - Finding all sub-palindromes in O(N)īurnside's lemma / Pólya enumeration theoremįinding the equation of a line for a segmentĬheck if points belong to the convex polygon in O(log N) Preserving the history of its values (Persistent Segment Tree)įinding the k-th smallest number in a rangeĭeleting from a data structure in O(T(n) log n)ĭynamic Programming on Broken Profile. Acceleration with "fractional cascading". With modification queries.įind the smallest number greater or equal to a specified number. No modification queries.įind the smallest number greater or equal to a specified number. Saving the entire subarrays in each vertexįind the smallest number greater or equal to a specified number. Searching for the first element greater than a given amount Searching for an array prefix with a given amount ![]() Euclidean algorithm for computing the greatest common divisorįinding the maximum and the number of times it appearsĬompute the greatest common divisor / least common multipleĬounting the number of zeros, searching for the k-th zero
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |