Consider the sweep-line algorithm for a set S = fs1 : : : sng of n segments (not necessarily horizontal or vertical). Assume that you stopped the algorithm once an intersecting pair is found. There are n(n1)=2 pairs of segments. However the algorithm does not check every pair for intersection. Only pairs that are consecutive on the sweeping line are checked. If it costs one dollar to check if si crosses sj , how many dollar (as as function of n) should you pay in the worst (most expensive) case ? Note that the same pair might be checked multiple times.

i want to say d but i could be wrong however it is organized if that could happen..

hope it could

solution:

bookmark is a word, symbol, image, or other object that links you to another element in another location.

bookmark is a saved shortcut that directs your browser to a specific webpage. it stores the title, url, and favicon of the corresponding page. saving bookmarks allows you to easily access your favorite locations on the web.

it works in all modern web browsers include bookmark features. bookmarks are called favorites or internet shortcuts in internet explorer, and by virtue of that browser's large market share, these terms have been synonymous with bookmark since the first browser war.