# Computational complexity question

by pemfir
Tags: complexity, computational
 P: 4 how can i represent the computational complexity an algorithm that requires the following number of operations: (please see attached document) $(N-1) + \sum_{i=1}^{N-3}(i+1)(N-2)!/{i!}$ Attached Thumbnails