Search:

Hi
i need recurrence for this algorithm

count ← 0
Alg(n,list)
If(n==0)
count++
Else
Return Alg(n-1,list);
Return count.

yes we are allowed to create a new stored file or we can use the old file.

ok fine i ll repost in new thread and more over these are not my homework problems. i am new to coding becz my background s biology. i m learng algorithms fr my thesis work. Hope u under stand

yup i will post in new thread with a new question and in the second question i am done with my algorithm but the analysg the time is bit cnfusing

secondly the the problem with the file sytem s...

Write a recursive algorithm that counts the number of times the integer 0 appears in a list of integers. Write a recurrence for the algorithm and solve it.

Write an algorithm that takes an array containing zeroes and ones, and returns true, if every sequence of consecutive ones is even. Else, it returns false. Analyze the running time of the algorithm.

I don't know which algorithm is used and more over i am not building the algorithm. So the basic question is is it possible to sort in O(n) time and by using only small amount of additional storage??

Suppose we have a file of n records which are partially sorted as x1 <= x2 <= x3 <= … <= xm, and xm+1 <= ….. <= xn, is it possible to sort the entire file in time O(n) using only a small fixed...