Skip to main content
Computer Science
Breakpoint's user avatar
Breakpoint's user avatar
Breakpoint's user avatar
Breakpoint
  • Member for 5 years, 5 months
  • Last seen this week
  • Internet
Profile Activity

31 Actions

All Accepts Posts Badges Comments Revisions Reviews Suggestions
awarded
 Caucus
awarded
 Notable Question
awarded
 Yearling
awarded
 Popular Question
comment
Solving a recurrence relation with T(n) = 2 * T(n/3) + 5n
@user2477349 check the updated answer
revised
Solving a recurrence relation with T(n) = 2 * T(n/3) + 5n
added solution to the problem
answered
Solving a recurrence relation with T(n) = 2 * T(n/3) + 5n
accepted
Recurrence relation and time complexity of recursive factorial
comment
Time complexity of $O(n)$ loop which has a multiplication ($O(n^2)$) in it
multiplication operation is a function of input, n. That is why input will have change in time complexity of multiplication
comment
pseudocode to split number value to array of numbers
@camille Check the solution, I have added
revised
pseudocode to split number value to array of numbers
added solution to the problem
answered
pseudocode to split number value to array of numbers
comment
Recurrence relation and time complexity of recursive factorial
@RickDecker does it mean that the recurrence relation in my question gives upper bound on value of 'n' and the answer of LukeMathieson gives upper bound on time complexity of function?
comment
Recurrence relation and time complexity of recursive factorial
Thanks Luke, but can you shed some light on the accepted answer of this link: stackoverflow.com/questions/1379929/recurrence-relation is it any correct?
revised
Recurrence relation and time complexity of recursive factorial
formatting
asked
Recurrence relation and time complexity of recursive factorial
awarded
 Supporter
comment
Describe construction of finite automata that accepts the language Double-Letter(L)
@YuvalFilmus I thought the op was asking dfa just for double-letter(L). Now that I re read the question, what you said makes sense.
revised
Describe construction of finite automata that accepts the language Double-Letter(L)
added 52 characters in body
answered
Describe construction of finite automata that accepts the language Double-Letter(L)
1
2