singaltanmay

// This is an implementation of Linear Search and Binary Search algorithms in C
#include <stdio.h>

int LinearSearch(int query, int input[], int array_size);

int BinarySearch(int query, int input[], int array_size);

int main() {

    int array_size = 0;

singaltanmay

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

struct node {
    int data;
    struct node *next;
};

int size_of_list = 0;
struct node *head;

singaltanmay

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

struct node {
    struct node *previous;
    int data;
    struct node *next;
};

int size_of_list = 0;

singaltanmay

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

struct node {
    int data;
    struct node *next;
};

int size_of_list = 0;
struct node *head;

singaltanmay

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

struct node {
    int data;
    struct node *next;
};

int size_of_queue = 0;
struct node *head = NULL;

singaltanmay

import org.apache.poi.hssf.usermodel.HSSFWorkbook;
import org.apache.poi.ss.usermodel.Row;
import org.apache.poi.ss.usermodel.Sheet;
import org.apache.poi.ss.usermodel.Workbook;

import java.io.*;

public class reader {

    /* Path of the .xls spreadsheet*/

singaltanmay

#include<stdio.h>

struct node {
    int row, col, value;
};

int main() {
    int col, row;
    printf("Enter no of Col = ");
    scanf("%d", &col);

singaltanmay

#include <iostream>
#include <conio>
#include <string.h>


class xyz {

char str[40];

public:

singaltanmay

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

enum arrayType
{
    INCREASING = 1,
    DECREASING = 2,
    RANDOM = 3
} order;

singaltanmay

import os


def rename():

    fpath = "/media/tanmsy/NAS/TV Shows/Westworld/Season 01/"
    os.chdir(fpath)

    nameList = os.listdir()