Day 140: Find triplets with zero sum.cpp

public:
    //Function to find triplets with zero sum.
    bool findTriplets(int arr[], int n)
    { 
        sort(arr,arr+n);
        for( int i = 0; i < n ; i++)
        {
        int j =i+1;
        int k = n-1;
        while( j<k)
        {
            if(arr[i]+arr[j] +arr[k]>0)
            k--;
            else if(arr[i]+arr[j] +arr[k]<0 )
            j++;
            
            else 
            return true;
            
        }
           
        }
        return false;
    }