What is considered a cubic algorithm when considering time complexity? -
I have implemented this algorithm and after analyzing the complexity of its time I have found that its upper bound is (O) is N ^ 2 * m) where n is the number of verticals in a graph and m is the number of edges. I am thinking that this would be considered a cubic algorithm? I know that o (n ^ 3) is cube, but I'm not sure because of "m". Anyone can explain that is it a cube or some other kind of complexity?
Graph algorithm, about a particular case time complexity, technically, o (n ^ 2 * M) quartic (o (n ^ 4)), since m = hey (n ^ 2) however, since many graph algorithms are sensitive to the number of edges, so we can reflect that sensitivity For the complexity of different corners and paving functions. If the graph is sparse (M = O), then O (n ^ 2m) is a cubic, but for a dense graph, it behaves like a quartic algorithm.
Comments
Post a Comment