Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
What’s the correct big O notation for an algorithm that runs in triangular time? Here’s an example:
func(x):
for i in 0..x
for j in 0..i
do_something(i, j)
My first instinct is O(n²), but I’m not entirely sure.
Yes, N*(N+1)/2, when you drop the constants and lower-order terms, leaves you with N-squared.