saniyusuf

[
  {
    "Title": "Avatar",
    "Year": "2009",
    "Rated": "PG-13",
    "Released": "18 Dec 2009",
    "Runtime": "162 min",
    "Genre": "Action, Adventure, Fantasy",
    "Director": "James Cameron",
    "Writer": "James Cameron",

ManiruzzamanAkash

/** 
Tree traverse code of Tree
@author : MANIRUZZAMAN AKASH 
**/

#include<stdio.h>
#include<stdlib.h>

typedef struct BSTnode{
	int data;

ManiruzzamanAkash

/** 
Insertion Sort in C language
@author: MANIRIZZAMAN AKASH 
@description: Insert value in the array and get the sorted array as insertion sort
**/

#include<stdio.h>
#define MAX 100

ManiruzzamanAkash

/**
LinkedList Complete Code of insert, delete, search, get total item
@author: Maniruzzaman Akash
**/

#include<stdio.h>
#include<stdlib.h>
typedef struct Node
{
        int data;

ManiruzzamanAkash

package infixtopostfix;

import java.util.Stack;
import java.util.Scanner;

public class InfixToPostfix {
    static int getPrecedence(char checkChar)
    {
        if(checkChar=='+'||checkChar=='-')

ManiruzzamanAkash

/** 
Infix to postfix code in C language
@author: Maniruzzaman Akash<[email protected]>
**/

#include<stdio.h>
#include<string.h>
#define MAX 50

    char stack[MAX];

ManiruzzamanAkash

/**
BFS code in C language
@author: Maniruzzaman Akash<[email protected]>
**/

#include<stdio.h>
int a[20][20],q[20],visited[20],n,i,j,f=0,r=-1;
void bfs(int v)
{
 for(i=1;i<=n;i++)

ManiruzzamanAkash

#include<stdio.h>
 
void DFS(int);
int G[1000][1000], visited[1000], n;    // n is no of vertices and graph is sorted in array G[1000][1000]

void DFS(int i)
{
    int j;
    printf("\n%d", i);
    visited[i] = 1;

ManiruzzamanAkash

/**
Gauss Elimination problem solution in C language [Basic]
@author : Maniruzzaman Akash
**/

#include<stdio.h>
int main(){
    int i, j, k, n;
    float matrix[100][100];
    float sum = 0.0;