I have 12 golfers total, and we are playing 6 rounds of golf with 4 golfers in each group...

I have 12 golfers total, and we are playing 6 rounds of golf with 4 golfers in each group. I want to try and have everybody play with each person at least once. I am having trouble doing this.

proof of log n! and a summation

prove that log n! and sum from i=2 to n log i have a theta relation to n log n

time complexity of an algorithm in theta notation

How much time does the following algorithm require as a funciton of n? Express your answer in theta notation in the simplest form. Consider each individual instruction (including loop control) as elementary. l = 0 for i = 1 to n for j = 1 to n^2 for k = 1 to n^3 l = l + 1

time complexity of an algorithm in theta notation

How much time does the following algorithm require as a function of n? Express your answer in "theta notation" in the simplest possible form. Show all work! l = 0 for i = 1 to n for j = 1 to i for k = j to n l = l +1

Solving recurrence exactly

Solve the following recurrence exactly for n of the form 2^2^k. T(2) = 1 T(n) = 2T(n^(1/2)) + log n Express your answer as simply as possible using theta notation. note added ** theta notation is based on big O notation Show all work!