**Finally, we must merge ALL the points together by y-coordinate:**
**(0, 0), (8, 0), (5, 1), (2, 3), (3, 4), (7, 4) , (1, 6), (6, 7), (2, 8)**
**this time, we only pick those points that are within of the line x=2 to copy into v. These points are:**
**(0, 0), (5, 1), (2, 3), (3, 4), (1, 6), (2, 8)**
**Now, we scan through all pairs to discover that the shortest distance between any of the two points is .**
**Strassen’s algorithm:Matrix multiplication**
**The standard method of matrix multiplication of two n x n matrices takes T(n) = O(n**^{3}**).**
**Share with your friends:** |