An algorithm that determines whether a string is a suffix of another string

requirements, do not open up new array memory

Public   Issuffix (string suffix, string str) {
    (Str.length () <suffix.length ()) {
        return false;
    }
    (i= 0;i<suffix.length (); i++) {item = Suffix.charat (Suffix.length () 
        -1-i) ;
         (Item==str.charat (Str.length () -1-i)) {
            continue;
        }
         {
            return false;
        }
    }
    return True;
}

The idea is that if the str length is less than suffix, the natural suffix is not the suffix

Then take suffix from backward forward and Str from backward to forward characters, if consistent,

And then you can go through the for loop, which proves to be the suffix