Revision as of 19:15, 20 December 2021 edit Khaledjawhar1983 (talk \| contribs) 47 edits →Persistent Data Structure Method ← Previous edit		Revision as of 03:50, 21 December 2021 edit undo Khaledjawhar1983 (talk \| contribs) 47 edits →Source Code Example of Next Search Problem Next edit →
Line 82: ====Source Code Example of Next Search Problem==== Below is a source code sample of how to find the segment above a given point q. This programs takes as input a list of segments and a query point and returns the starting point and the ending point of the segment above it. <syntaxhighlight lang="C++" line> #include <iostream>

Persistent data structure: Difference between revisions