**These are the following arguments which are present in pattern matching Algorithms:**

1) Subject,

2) Pattern

3) Cursor

4) MATCH_STR

5) REPLACE_STR

6) REPLACE_FLAG

**Sorting by merging is a recursive, divide-and-conquer strategy. The basic steps to perform are the following:**

a) divide the sequence into two sequences of length

b) recursively sort each of the two subsequences

c) merge the sorted subsequences to obtain the final result

**There are four parts in the iterative process they are:**

**Initialization: -**The decision parameter is used to determine when to exit from the loop.

**Decision: -**The decision parameter is used to determine whether to remain in the loop or not.

**Computation: -** The required computation is performed in this part.

**Update: -** The decision parameter is updated and a trfer to the next iteration results.

This algorithm constructs the vectors TITLE, KEYWORD and T_INDEX.

It is a method by which a key can be securely shared by two users without any actual exchange.

In the algorithmic notation rather than using special marker symbols, generally people use the cursor position plus a substring length to isolate a substring. The name of the function is SUB.

SUB returns a value the sub string of SUBJECT that is specified by the parameters i and j and an assumed value of j.

- Find the no. of elements on the left side.
- If it is n-1 the root is the median.
- If it is more than n-1, then it has already been found in the left subtree.
- Else it should be in the right subtree

**Sorting algorithms can be divided into five categories:**

a) insertion sorts

b) exchange sorts

c) selection sorts

d) merge sorts

e) distribution sorts

**An algorithm that sorts by insertion takes the initial, unsorted sequence and computes a series of sorted sequences using the following rules:**

a) the first sequence in the series is the empty sequence

b) given a sequence S(i) in the series, for 0<=i

**In quicksort, the steps performed are the following:**

a) pick an element, called a pivot, from the list

b) reorder the list so that all elements with values less than the pivot come before the pivot, while all elements with values greater than the pivot come after it (equal values can go either way)

c) recursively sort the sub-list of lesser elements and the sub-list of greater elements.

**The three most important skills which are used extensively while working with generating functions are:**

1)Manipulate summation expressions and their indices.

2)Solve algebraic equations and manipulate algebraic expressions, including partial function decompositions.

3)Identify sequences with their generating functions.

**Insertion sort provides several advantages:**

a) simple implementation

b) efficient for small data sets

c) adaptive - efficient for data sets that are already substantially sorted: the time complexity is O(n + d), where d is the number of inversions

d) more efficient in practice than most other simple quadratic, i.e. O(n2) algorithms such as selection sort or bubble sort; the best case (nearly sorted input) is O(n)

e) stable - does not change the relative order of elements with equal keys

f) in-place - only requires a constant amount O( 1) of additional memory space

g) online - can sort a list as it receives it