In algorithm analysis, we assume a generic one processor Random Access Machine (RAM). As far as I know, the RAM machine is no more efficient than the Turing machine. All algorithms can be implemented in the Turing machine. So my questions are:
If the Turing machine is as efficient as the RAM machine, then why are we not assuming Turing machine for algorithm analysis?
What is the difference between RAM and TM?