Before revision:  The algorithm performance is O(n ^{2 ) when applied to a set of n entities, and its outcome is a dendrogram exhibiting the connections of those entities.
After revision:  The algorithm performance is O(n ^2 ) when applied to a set of n entities, and its outcome is a dendrogram exhibiting the connections of those entities.