if an algorithm takes a total time of T(log n + n^2), is this big O(log n + n^2) or simply big O(n^2) ?
unclepauly 6 Light Poster
Be a part of the DaniWeb community
We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.