On 15th March Learn How to Crack Coding Interview - Sorting Algorithms
When: 15th March 2015
Duration: 3 Hours (02:00 PM to 05:00 PM)
Where: H-217, First Floor, Sector 63, Noida
Price: Free of cost
Requirement: Optional to bring your laptop and internet card
On 15th March 2015 we are going to teach you following topics,
We highly recommend reading the previous session recap's
Sorting Terminologies
- Comparison v/s Non-comparison sorting algorithms
- Stable v/s unstable sorting
- Divide and Conquer Algorithms
- In-place sorting
- Adversary argument for lower bound of comparison sort algorithms
Comparison Sorting Algorithms
- Bubble/Selection Sort (with improvements to make it run in best case linear time)
- Insertion Sort
- Heap Sort
- Quick Sort
- Merge Sort
Sorting in Linear time
- Counting Sort
- Bucket Sort
Registration starts at 01:30 AM. So we request you to be there at 01:30 to
get a seat.
Speaker
Kamal Rawat @kamal_rawat
Kamal is having 10+ years working experience and currently working with Adobe
Systems as a computer scientist, ex. Senior SDE at Microsoft IDC hyderabad, he
loves to educate people.
Queries concerning your registration should be addressed to [email protected]
or call at 0120- 4256016.