tally solution qstn are subjective it includes appti , c/c++ output ,sql nd
data structure mailny link list
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To
Hi All,
I am student at CSUS. I am looking some topics on database or cloud
computing for my Master's project.
It would be helpful, if anyone provides me an good idea on it.
Thanks,
Sweety
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group
Question :Let A[1..n] be an array of integers. Design an efficient
divide and conquer algorithm to determine if A contains a majority
element, i.e an element appears more than n/2 times in A. What is the
time complexity of your algorithm?
Answer:
a[1..n] is an array
int majorityElement(int a[],
