Srinivas Devaki zsrinivas

## a-non-recursive-implementation-of-merge-sort.c
#include <stdio.h>
#include <math.h>
int main(int argc, char const *argv[])
{
	long long int array[10000],n,/*array size*/lon,i;
	long long int output[10000],j,k,low,high,mid,l,m,lowi,highi,midi;
	scanf("%lld", &n);
	lon=log2(n);
	for (i = 0; i < n; ++i)
	{

## muldiv.c
/*wrong code*/
#include <stdio.h>
#include <math.h>
int main(int argc, char const *argv[])
{
	long long int i,n,k,m,t,nin,printout;
	scanf("%lld", &t);
	while(t--)
	{
		scanf("%lld%lld%lld",&n,&k,&m);

## -
youtube-dl -f 17 --extract-audio --audio-format=mp3 https://www.youtube.com/watch?v=pM4XqykQQfE

## main.sh
#!/bin/bash
ls *.epub > main
while read line
do
    name=$line
    ebook-convert "$line" "$line".pdf
done < $1

## main.sh
#!/bin/bash
ls *.epub > main
while read line
do
    name=$line
    ebook-convert "$line" "$line".pdf
done < $1

## -
sudo apt-get install calibre

## -
ls *.epub


## -
ls *.epub > main


## main.sh
#!/bin/bash
ls *.epub > main
while read line
do
    ebook-convert "$line" "$line".pdf
done < $1

## -
sudo apt-get install calibre
	#include <stdio.h>
	#include <math.h>
	int main(int argc, char const *argv[])
	{
	long long int array[10000],n,/array size/lon,i;
	long long int output[10000],j,k,low,high,mid,l,m,lowi,highi,midi;
	scanf("%lld", &n);
	lon=log2(n);
	for (i = 0; i < n; ++i)
	{
	/wrong code/
	#include <stdio.h>
	#include <math.h>
	int main(int argc, char const *argv[])
	{
	long long int i,n,k,m,t,nin,printout;
	scanf("%lld", &t);
	while(t--)
	{
	scanf("%lld%lld%lld",&n,&k,&m);
	#!/bin/bash
	ls *.epub > main
	while read line
	do
	name=$line
	ebook-convert "$line" "$line".pdf
	done < $1