Pregunta de entrevista de Crest Infosystems

DAA Questions What is Big O notation? Difference between greedy and dynamic programming. Explain divide and conquer approach. Time complexity of common sorting algorithms.