hintslibrary.blogspot.com

cpluspluscode.blogspot.com

C++ Code: Simple Regex matcher in C++

http://cpluspluscode.blogspot.com/2015/01/simple-regex-matcher-in-c.html

Sample Reusable Code in written in C. Tuesday, January 27, 2015. Simple Regex matcher in C. A regular expression is a set of pattern matching rules encoded in a string.Regular expression may match whole string or substring. Here we will implement a regular expression matcher which will support . (dot), *, and $. Dot matches any single character. Matches preceding character zero or more time. Itr str. size. Itr, str. length. Itr regex. size. Itr, regex. length. Itr), str. substr. Itr, str. length.

cpluspluscode.blogspot.com

C++ Code: January 2014

http://cpluspluscode.blogspot.com/2014_01_01_archive.html

Sample Reusable Code in written in C. Wednesday, January 29, 2014. Implementing Counting sort C. Counting sort is a technique which sorts input in o(n). Time complexity if it falls in particular range. As the input falls in particular range, the counting method works well and can be rearranged easily. Counting sort maintain count of each element appearing in the input then it places those in the order. Typedef vector int IntVect;. Void CountingSort(IntVect and A, IntVect and B, int range). Temp[A[i] = 1;.

cpluspluscode.blogspot.com

C++ Code: September 2012

http://cpluspluscode.blogspot.com/2012_09_01_archive.html

Sample Reusable Code in written in C. Sunday, September 30, 2012. Implementing Binary Search Algorithm in C /C. Int BinarySearch( int * intArray, int start, int end, int key). While( start = end ). Int mid = (start end)/2;. If( intArray[mid] = key). If( key intArray[mid] ). End = mid - 1;. Start = mid 1;. Binary search can also be implemented in recursive way as below. Int RecBinarySearch( int * intArray, int start, int end, int key). If( start = end ). Int mid = (start end)/2;. If( intArray[mid] = key).

cpluspluscode.blogspot.com

C++ Code: May 2013

http://cpluspluscode.blogspot.com/2013_05_01_archive.html

Sample Reusable Code in written in C. Thursday, May 30, 2013. Find two elements in array having sum equal to given element. We can use insertion sort method to find the two element from the array having sum same as given element. Method FindSum displays two elements from array having sum same as given element. Void FindSum( int * a, int size, int Sum). Int firstNum = 0, secondNum = -1;. For(; firstNum size; firstNum ). Int sercahKey = Sum - a[firstNum];. For( int i = firstNum 1; i size; i ). If( nSize 1 ).

cpluspluscode.blogspot.com

C++ Code: March 2011

http://cpluspluscode.blogspot.com/2011_03_01_archive.html

Sample Reusable Code in written in C. Wednesday, March 9, 2011. Code: Remove duplicate characters from string. Earlier we have seen code for checking for duplicates. We are now going to extend that code to remove the duplicates from the string. NULL = pchStringofDuplicates NULL = (pchStringofDuplicates 1). PchPointToEnd, *pchPointToStart = pchStringofDuplicates ;. PchPointToEnd = pchStringofDuplicates;. PchComparator = pchPointToStart;. PchStringofDuplicates = *pchComparator;. Monday, March 7, 2011.

cpluspluscode.blogspot.com

C++ Code: February 2011

http://cpluspluscode.blogspot.com/2011_02_01_archive.html

Sample Reusable Code in written in C. Friday, February 25, 2011. C Code for String Reverse. Here is a code for a program which does task of reversing the input string. If string is empty or having one character no need to reverse. If(pchStringToReverse = NULL (pcStringToReverse 1 ) = NULL). Char* pchPointToLast = pchStringToReverse;. Char chTempStorage = *pchStringToReverse;. PchStringToReverse = *pchPointToLast;. PchPointToLast- = chTempStorage;. Unit Test Cases for above function:.

cpluspluscode.blogspot.com

C++ Code: Longest Increasing Subsequence C++ Implementation

http://cpluspluscode.blogspot.com/2015/01/longest-increasing-subsequence-c.html

Sample Reusable Code in written in C. Wednesday, January 28, 2015. Longest Increasing Subsequence C Implementation. Problem is to find the length of the longest increasing sequence from given sequence. We will also print longest sequence, if there are more than one longest sequence with same length we will print one of the sequence. You can find more details of the problem at wiki: Longest increasing subsequence. I input. size. MaxSoFar = storage[ j. MaxSeq = storage[ i. I = ( int. I = sequence[ i.

cpluspluscode.blogspot.com

C++ Code: February 2012

http://cpluspluscode.blogspot.com/2012_02_01_archive.html

Sample Reusable Code in written in C. Thursday, February 16, 2012. Finding Middle node of the singly link list with recursion. You could find middle of the single linked list in multiple ways :. Simple traverse whole list once to count number of nodes in the list, then again traverse till mid element. Use recursion to find mid. Here we will discuss how to reach till the mid using recursion:. Int FindMid(Node * head, int nNumberOfNode = 0). If( NULL = head ). Cout "Mid Node data: " head- data endl;. The o...

cpluspluscode.blogspot.com

C++ Code: July 2012

http://cpluspluscode.blogspot.com/2012_07_01_archive.html

Sample Reusable Code in written in C. Friday, July 27, 2012. Implementing Insertion sort in C/C. Below function implements the insertion sort algorithm. The function takes input as a array of integers and size of the array. The sorting is performed in place. Void InsertionSort(int * array, int size). We are starting from second element of the array. For(int counter = 1; counter size; counter ). Int nKey = array[counter];. Int tempCounter = counter-1;. While(tempCounter = 0 & array[tempCounter] nKey ).

cpluspluscode.blogspot.com

C++ Code: String combinations in lexicographical order

http://cpluspluscode.blogspot.com/2015/01/string-combinations-in-lexicographical.html

Sample Reusable Code in written in C. Wednesday, January 28, 2015. String combinations in lexicographical order. Problem is to create list of all possible combinations of letters of a given string. If two strings are with the same set of characters, the lexicographically smallest arrangement of the two strings should appear first. For string "abcd" possible combinations would be:. The code below is the cpp implementation for the problem above. Print comb utils( string. I=pos; i str. size. Str, tmp2, i 1.