Posts

Showing posts from November, 2017

Venture Capital Funds V/S Mutual Funds

Larger mutual funds and people having a lot of stable funding are a lot of probably to speculate in in private command startups called unicorns. Mutual funds are less concerned in company governance, particularly boards of administrators, however have a lot of protections once it involves liquidating their stakes. What is ' Venture Capital Funds '? Venture capital funds area unit investment that manage the cash of investors United Nations agency get non-public equity stakes in startup and small- to medium-sized enterprises with sturdy growth potential. These investments area unit typically characterised as high-risk/high-return opportunities. What is ' Mutual Funds' ? A open-end investment company may be a professionally-managed investment theme, typically go by associate degree quality management company that brings along a gaggle of individuals and invests their cash in stocks, bonds and alternative securities. Mutual Fund 'units', is basically represe

Merge Sort Algorithm in c/c++

Merge Sort Algorithm in c/c++ #include<stdio.h> #include<conio.h> int a[100],b[100]; void mergesort(int low,int mid, int high) {             int h=low,i=low,j=mid+1;             while(h<=mid && j<=high)             {                         if(a[h]<a[j])                         {                                     b[i]=a[h];                                     h=h+1;                         }                         else                         {                                     b[i]=a[j];                                     j=j+1;                         }                         i=i+1;             }             if(h>mid)             {                         for(int k=j;k<=high;k++)                         {                                     b[i]=a[k];                                     i=i+1;                         }             }             else             {                         for(int k=h;k<=

linked queue algorithm using c/c++

linked queue algorithm using c/c++ #include<stdio.h> #include<conio.h> int a[100],front=-1,rear=-1; void main() {                 clrscr();                 void iqueue();                 int dqueue();                 void diplayque();                 int n,ind;                 while(1)                 {                                 printf("\n\n\t Perform Task : \n\t 1. Push \n\t 2. Pop \n\t 3. Display \n\t 4. Exit");                                 printf("\n\tEnter your Choices ");                                 scanf("%d",&n);                                 if(n==4)                                                 break;                                 switch(n)                                 {                                                 case 1:                                                                 iqueue();                                                                 break;