Project translated automatically. Log in or register, to view the original To realize the C++ algorithm is naive and optimized so that it is faster. Time measurement on each algorithm. You are given a mass of coordinates that keeps the coordinates of points: coordinates[i] = [x, y]. Check if these points form a straight line on the flat. Illustration of the first example: Illustration of the second example: Example of introduction 1: And [this] is the one that [this] is the one that [this] is the one that [this] is the one that [this] is the one that [this] is the one that [this] is the one that [this] is the one that [this] is the one that [this] is the one that [this] is the one that [this]. Examples of conclusion 1: True Example of Introduction 2: And [this] is the one that [this] is the one that [this] is the one that [this] is the one that [this] is the one that [this] is the one that [this] is the one that [this] is the one that [this] is the one that [this] is the one that [this] is the one that [this]. Examples of conclusion 2: false

Proposals 1