menu
QAmmunity.org
Questions by Mandrive
Login
Register
My account
Edit my Profile
Private messages
My favorites
Register
Questions by Mandrive
Ask a Question
Questions
Unanswered
Tags
Categories
Ask a Question
Questions by Mandrive
Filter
User Mandrive
Recent activity
All questions
All answers
Suppose for the worst case, given input size n: Algorithm 1 performs f(n) = n2 + n/2 steps Algorithm 2 performs f(n) = 12n + 500 steps What is the smallest value of n for which algorithm 2 will be faster
asked
Sep 12, 2020
Computers and Technology
college
1
answer
2
votes
7.7k
views
The fact that researchers use systematic observation to study human behavior illustrates which of your text’s unifying themes?
asked
Aug 22, 2020
Social Studies
high-school
1
answer
1
vote
1.4k
views
What is the speed traveling 400m in 253 seconds
asked
Aug 18, 2019
Mathematics
college
1
answer
1
vote
116k
views
Write a real world problem you could answer by solving the equation -8x+ 60= 28.
asked
May 7, 2018
Mathematics
middle-school
1
answer
0
votes
174k
views
Page:
« prev
1
2
Ask a Question
Welcome to QAmmunity.org, where you can ask questions and receive answers from other members of our community.
6.5m
questions
8.6m
answers
Search QAmmunity.org