Instead of having separate post for each question, somehow it made sense to put all the basic questions here in one question section.

1. What is heap sort? What’s the efficiency ?

2. What is the difference between Merge Sort and Quick sort?

3. Give pseudo-code for the mergesort algorithm.

4. Implement the bubble sort algorithm. Show some improvements over the basic bubble sort.

5. Write the code for selection sort.

6. Write the code for quick sort.

7. Write the code for insertion sort.

8. How to sort objects that are too large to bring into memory?

9. For very small input which algorithm will work best?

2. What is the difference between Merge Sort and Quick sort?

3. Give pseudo-code for the mergesort algorithm.

4. Implement the bubble sort algorithm. Show some improvements over the basic bubble sort.

5. Write the code for selection sort.

6. Write the code for quick sort.

7. Write the code for insertion sort.

8. How to sort objects that are too large to bring into memory?

9. For very small input which algorithm will work best?

This should act as a checklist. I will add individual post for each of the questions and link them here.

(For responding with answers, please do mention the question no for reference here.)

(For responding with answers, please do mention the question no for reference here.)

## 0 comments:

## Post a Comment