Milad Abbasi miladabc

## cloudSettings
{"lastUpload":"2020-04-25T14:43:19.825Z","extensionVersion":"v3.4.3"}

## compton.conf
#################################
#
# Backend
#
#################################

# Backend to use: "xrender" or "glx".
# GLX backend is typically much faster but depends on a sane driver.
backend = "glx";

## agent.html
<!DOCTYPE html>
<html>
<head>
<title>Water Agent</title>
<script>
const greenHouse = [
	[0, 1, 0],
	[1, 0, 1]
];

## maze.js
//Milad Abbasi
//06-07-2018
//Finding the first available path in a maze

var buckets = require('../modules/buckets.js');
var stack = new buckets.Stack();

function Element(row, col, dir) {
	this.row = row;
	this.col = col;

## searchSort.cpp
//Milad Abbasi
//06-07-2018
//Searching and Sorting algorithms

#include <iostream>
#include <random>
#include <time.h>
#include <string.h>
using namespace std;

## stackLinkedList.cpp
//Milad Abbasi
//06-07-2018
//Stack implementation with Linked List

#include <iostream>
using namespace std;

class Node
{
public:

## stackArray.cpp
//Milad Abbasi
//06-07-2018
//Stack implementation with Array

#include <iostream>
using namespace std;

#define MAX_SIZE 1000

class Stack

## singlyLinkedList.cpp
//Milad Abbasi
//06-07-2018
//Singly Linked List

#include <iostream>
using namespace std;

class Node
{
public:

## queueLinkedList.cpp
//Milad Abbasi
//06-07-2018
//Queue implementation with Linked List

#include <iostream>
using namespace std;

class Node
{
public:

## queueArray.cpp
//Milad Abbasi
//06-07-2018
//Queue implementation with Array

#include<iostream>
using namespace std;
#define MAX_SIZE 5

class Queue
{
	#################################
	#
	# Backend
	#
	#################################

	# Backend to use: "xrender" or "glx".
	# GLX backend is typically much faster but depends on a sane driver.
	backend = "glx";
	<!DOCTYPE html>
	<html>
	<head>
	<title>Water Agent</title>
	<script>
	const greenHouse = [
	[0, 1, 0],
	[1, 0, 1]
	];
	//Milad Abbasi
	//06-07-2018
	//Finding the first available path in a maze

	var buckets = require('../modules/buckets.js');
	var stack = new buckets.Stack();

	function Element(row, col, dir) {
	this.row = row;
	this.col = col;
	//Milad Abbasi
	//06-07-2018
	//Searching and Sorting algorithms

	#include <iostream>
	#include <random>
	#include <time.h>
	#include <string.h>
	using namespace std;
	//Milad Abbasi
	//06-07-2018
	//Stack implementation with Linked List

	#include <iostream>
	using namespace std;

	class Node
	{
	public:
	//Milad Abbasi
	//06-07-2018
	//Stack implementation with Array

	#include <iostream>
	using namespace std;

	#define MAX_SIZE 1000

	class Stack
	//Milad Abbasi
	//06-07-2018
	//Singly Linked List

	#include <iostream>
	using namespace std;

	class Node
	{
	public:
	//Milad Abbasi
	//06-07-2018
	//Queue implementation with Linked List

	#include <iostream>
	using namespace std;

	class Node
	{
	public:
	//Milad Abbasi
	//06-07-2018
	//Queue implementation with Array

	#include<iostream>
	using namespace std;
	#define MAX_SIZE 5

	class Queue
	{