Answer 1

I agree with Gordie try th divide and conquer method its a method that breaks down a problem into smaller chunks.

Answer 2

@Gordie is right. Doesn't exist one simple method. You need to study the basics technics and problems in algorithms. If you have doubt if one problem you are facing is a for example: knapsack problem. Or with a solution to optimize if certain situation/problem is good free fell to ask.

Answer 3

Time complexity shows how fast your algorithm is when its implemented.
For example Log(n 0)

Answer 4

with me

Answer 5

well this is random