This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <stdio.h> | |
#include <stdlib.h> | |
#define max 100001 | |
void countInv(long long int a[],long long int l,long long int n,long long int *count); | |
void countSplit(long long int a[],long long int l,int long mid,long long int n,long long int *count); | |
int main() | |
{ | |
long long int count=0,size,a[max],i; | |
printf("Enter array size: "); //input array size |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <stdio.h> | |
#include <stdlib.h> | |
#include <conio.h> | |
#define max 10 | |
//a structure to represent node of an adjacency list | |
typedef struct AdjListNode | |
{ | |
int dest; | |
struct AdjListNode* next; | |
}AdjListNode; |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <stdio.h> | |
#include <stdlib.h> | |
#include <conio.h> | |
typedef struct node | |
{ | |
int data; | |
struct node *left; | |
struct node *right; | |
}node; |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <stdio.h> | |
#include <stdlib.h> | |
#include <conio.h> | |
typedef struct node | |
{ | |
int data,height; | |
struct node *left,*right; | |
}node; |
NewerOlder