/algorithm_cpp

Algorithms

Primary LanguageC++

algorithm_cpp

Algorithms

cpp201708

1.Maximum Profit

  • minv = R[0]
  • for j from 1 to n-1
    • maxv = max(maxv,R[j]-minv)
    • minv = min(R[j],minv)

2.Insertion Sort

insertSort(A,N)
    for i 1 to N-1
        v=A[i]
        j=i-1;
        while j>=0 && A[j]>v
            A[j+1]=j
            j--
        A[j+1]=v

3.Bubble Sort

bubbleSort(A,N)
    flag=1
    i=0
    while flag
        flag=0
        for j N-1 to j-i
            if A[j]< A[j-1]
                swap(A[j],A[j-1])
                flag=1
    i++

4.Selection Sort

selectionSort(A,N)
    for i 0 to N-1
      minIndex =i;
      for j i to N-1
        if A[j]< A[minIndex]
            minIndex=j;
      swap(A[i],A[minIndex])

5.Shell Sort

insertionSort(A,n,g)
    for i= g to n-1
        v=A[i];
        j=i-g;
        while(j>=0 && A[j]>v)
            A[j+g]=A[j];
            j-=g;
        A[j+g]=v;

shellSort(A,n)
    cnt=0
    m=G.size
    G[]={1,4,13,40,...3*h+1}
    for i= m-1 to 0
        insertionSort(A,n,G[i])