Some good techniques to know

Some good techniques to know

Data Structures

1. Queue
2. Stacks
3. Trees
4. Graphs

Recursion

Dynamic Programming 

Divide and Conquer

Comments

Post a Comment

Popular posts from this blog

Insertion Sort

Image
Introducion Input: A sequence of n numbers ( a 1 , a 2   . . . , a n )  Output: A permutation (reordering) ( a' 1 , a' 2 , . . . , a' n ) of the input sequence such that a' 1 < a' 2 <. . . < a' n .  The numbers that we wish to sort are also known as the keys . Although conceptually we are sorting a sequence, the input comes to us in the form of an array with n elements. Sorting a hand of cards using insertion sort. We start with insertion sort, which is an efficient algorithm for sorting a small number of elements. Insertion sort works the way many people sort a hand of playing cards. We start with an empty left hand and the cards face down on the table. We then remove one card at a time from the table and insert it into the correct position in the left hand. To find the correct position for a card, we compare it with each of the cards already in the hand, from right to left. At all times, the cards held in the left hand are s...
Read more

Introduction to sorting

Introduction Any number of practical applications in computing require things to be in order. Even before we start computing, the importance of sorting is drilled into us. From group pictures that require the tallest people to stand in the back, to the highest grossing salesman getting the largest Christmas bonus, the need to put things smallest to largest or first to last cannot be underestimated. When we query a database, and append an ORDER BY clause, we are sorting. When we look for an entry in the phone book, we are dealing with a list that has already been sorted. (And imagine if it weren’t!) If you need to search through an array efficiently using a binary search, it is necessary to first sort the array. When a problem statement dictates that in the case of a tie we should return the lexicographically first result, well… you get the idea. General Considerations Imagine taking a group of people, giving them each a deck of cards that has been shuffled, and requesting that they sor...
Read more