Game Theory 1

নিম গেম

কনভেক্স হাল(Convex Hull)

If you don't know what Convex Hull is,read the following articles sequentially.Hope,you'll get vast knowledge.Since there are a lot of tutorials on Convex Hull,we'll rather discuss here some related problems & their solutions.

Tutorials on Convex Hull & it's prerequisites:

1.Orientation of 3 ordered points(prerequisite)
2.How to check if two given line segments intersect?(prerequisite)
3.Implementation of Graham Scan Algorithm for Convex Hull(Implementation)

STL Algorithm

Algorithm Used in Vector

(i) Non-Manipulating Algorithms:

          1. sort(first_iterator,last_iterator)-To sort a given vector.

          2. reverse(first_iterator,last_iterator)-To reverse a given vector.

          3. *max_element(first_iterator,last_iterator)-To find the maximum element of a vector

          4. *min_element(first_iterator,last_iterator)-To find the minimum element of a vector 

          5. accumulate(first_iterator,last_iterator.initial value of sum)-Does the summation of vector elements.

          6. count(first_iterator,last_iterator,x)-Count the occurrence in vector.

          7. find(first_iterator,last_iterator,x)-Points the last address of the vector if the element is not found