Selection sort implementation in python

Here is a simple python implementation of selection sort. The asymptotic complexity of selection sort is n^2

Balanced Binary Tree from sorted array

Create a balanced binary tree from sorted array

Array character sequence replacement with another array sequence

In this program a character sequence in an an array is replaced with another.

 Example

 Input string : "mary had a little lamp"

 "little" needs to be replaced with "big"

 Output string : " "mary had a big lamp"

Implementation of Hash table in CPP

Implementation of Hash table in CPP

Stack implementation in CPP

Here is a stack implementation in CPP

Variable arguments in C

Variable arguments can be passed to a function in C. The best example for this is the inbuilt printf function. For printf the first argument is a character array and variable number of arguments after that. This is implemented using macros within the stdarg header. When parameters are passed to a function , its copied to a stack created for that function. va_list and va_arg and va_end are macros which help traverse thru this stack. This is partial implementation of your own printf function.

Replace where ever question mark is there in a string with 0 and 1 with all the patterns created.

Example : input string "a??b?" outputs are a00b0,a00b1,a01b0, a01b1... like that all possiblities Here is the sample code for same