C# Online Compiler | .NET Fiddle

<no name> by JuanFarias

using System;
using System.Collections.Generic;

public class Program
{
	List<Bin> bins = new List<Bin>(1);
	List<float> assets = new List<float>(1);
	float epsilon = 10f;
	Random r = new Random();
	List<float> arr = new List<float>{1f, 3f, 4f, 5f, 2f};
	
	public static void Main()
	{
		Program instance_obj = new Program();
		instance_obj.GenarateRandomAssets(instance_obj.assets, instance_obj.r, 1000);
		//instance_obj.BinPack(instance_obj.assets);
		//Console.WriteLine(instance_obj.assets);
		//Console.WriteLine(instance_obj.assets.Count);
		//instance_obj.BinPack2(instance_obj.assets);
		instance_obj.BinPack3(instance_obj.assets);
		/*
		instance_obj.CycleElements2(instance_obj.arr);
		for (var i = 0; i < instance_obj.arr.Count; i++)
		{
			Console.WriteLine(instance_obj.arr[i]);
		}
		*/
	}
	
	// First Fit Implementation with randomized picking
	public void BinPack(List<float> assets)
	{
		Bin b_i = new Bin(10f);
		bins.Add(b_i);
		
		for (var i = 0; i < assets.Count; i++)
		{
			if (assets[i] < (bins[0].GetCapacity() - bins[0].GetCurrentCap()))
			{
				bins[0].AddElement(assets[i]);
				//Console.WriteLine(bins[0].GetCurrentCap());
				//bins[0].PrintElements();
			}
			else 
			{
				Bin b_i2 = new Bin(10f);
				Bin b_ii = bins[0];
				bins.Remove(bins[0]);
				bins.Add(b_i2);
				bins.Add(b_ii);
			}
		}
		// Print Test Results
		//Console.WriteLine("The Number of Bins is " + bins.Count);
		//float avgBinMem = 0f;
		//float N = bins.Count;
		//float totMem = 0f;
		//for (var k = 0; k < bins.Count; k++)
		//{
		//	Console.WriteLine("Length of bin: " + k + " is " + bins[k].GetElementsLength());
		//	totMem += bins[k].GetMem();
		//}
		//avgBinMem = totMem / N;
		//Console.WriteLine("Average memory per bin is " + avgBinMem);
		
	}
	
	// Best Fit Implementation with randomized picking
	public void BinPack2(List<float> assets)
	{
		Bin b_i = new Bin(10f);
		bins.Add(b_i);
		
		for (var i = 0; i < assets.Count; i++)
		{
			if (assets[i] < (bins[0].GetCapacity() - bins[0].GetCurrentCap()))
			{
				//Console.WriteLine("What it do! Current cap is " + bins[0].GetCurrentCap());
				bins[0].AddElement(assets[i]);
				//Console.WriteLine(assets[i]);
				assets.Remove(i);
				//Console.WriteLine(bins[0].GetCurrentCap());
				//bins[0].PrintElements();
			}
			else 
			{
				if (bins.Count == 1)
				{
					Console.WriteLine("We are here");
					Bin b_i2 = new Bin(10f);
					//Bin b_ii = bins[0];
					//bins.Remove(bins[0]);
					bins.Add(b_i2);
					//bins.Add(b_ii);
				}
				else 
				{
					//Console.WriteLine(" I am going mad!");
					Bin b_i3 = new Bin(10f);
					//Bin b_ii = bins[0];
					//bins.Remove(bins[0]);
					bins.Add(b_i3);
					CycleElements3(bins);
					//bins.Add(b_ii);
				}
			}
		}
		// Print Test Results
		Console.WriteLine("The Number of Bins is " + bins.Count);
		float avgBinMem = 0f;
		//float N = bins.Count;
		float N = 0;
		float totMem = 0f;
		
		for (var k = 0; k < bins.Count; k++)
		{
			if (bins[k].GetElementsLength() != 0)
			{
				N++;
			}
			
			Console.WriteLine("Length of bin: " + k + " is " + bins[k].GetElementsLength());
			totMem += bins[k].GetMem();
		}
		Console.WriteLine("The denominator N is " + N);
		avgBinMem = totMem / N;
		Console.WriteLine("Average memory per bin is " + avgBinMem);
		
	}
	
		// Nearest Fit Best Fit
	public void BinPack3(List<float> assets)
	{
		Bin b_i = new Bin(10f);
		bins.Add(b_i);
		
		for (var i = 0; i < assets.Count; i++)
		{
			if (assets[i] < (bins[0].GetCapacity() - bins[0].GetCurrentCap()))
			{
				//Console.WriteLine("What it do! Current cap is " + bins[0].GetCurrentCap());
				bins[0].AddElement(assets[i]);
				//Console.WriteLine(assets[i]);
				assets.Remove(i);
				//Console.WriteLine(bins[0].GetCurrentCap());
				//bins[0].PrintElements();
			}
			else 
			{
				// Find object closest to overflow and continue looking 
				float overflow = bins[0].GetCurrentCap() - bins[0].GetCapacity();
				float closest = 10000000;	// Arbitrarily large init point say inf
				for (var k = 0; k < assets.Count; k++)
				{
					if (overflow - assets[k] < closest)
					{
						closest = assets[k];
					}
				}
				bins[0].AddElement(closest);
				
				if (bins.Count == 1)
				{
					Console.WriteLine("We are here");
					Bin b_i2 = new Bin(10f);
					//Bin b_ii = bins[0];
					//bins.Remove(bins[0]);
					bins.Add(b_i2);
					//bins.Add(b_ii);
				}
				else 
				{
					//Console.WriteLine(" I am going mad!");
					Bin b_i3 = new Bin(10f);
					//Bin b_ii = bins[0];
					//bins.Remove(bins[0]);
					bins.Add(b_i3);
					CycleElements3(bins);
					//bins.Add(b_ii);
				}
			}
		}
		// Print Test Results
		Console.WriteLine("The Number of Bins is " + bins.Count);
		float avgBinMem = 0f;
		//float N = bins.Count;
		float N = 0;
		float totMem = 0f;
		
		for (var k = 0; k < bins.Count; k++)
		{
			if (bins[k].GetElementsLength() != 0)
			{
				N++;
			}
			
			Console.WriteLine("Length of bin: " + k + " is " + bins[k].GetElementsLength());
			totMem += bins[k].GetMem();
		}
		Console.WriteLine("The denominator N is " + N);
		avgBinMem = totMem / N;
		Console.WriteLine("Average memory per bin is " + avgBinMem);
		
	}
	
	
	public void CycleElements2(List<float> ls)
	{
		var index = ls.Count-2;
		//int j = index;
		for (var i = index; i > 0; i--)
		{
			Console.WriteLine("AAA");
			//var temp = ls[index];
			var temp = ls[index];
			ls[index] = ls[i-1];
			ls[i-1] = temp;
		}
	}
	
	public void CycleElements3(List<Bin> ls)
	{
		var index = ls.Count-2;
		//int j = index;
		for (var i = index; i > 0; i--)
		{
			//Console.WriteLine("AAA");
			//var temp = ls[index];
			var temp = ls[index];
			ls[index] = ls[i-1];
			ls[i-1] = temp;
		}
	}
	
	public void CycleElements(List<Bin> ls)
	{
		var index = ls.Count-2;
		for (var i = index; i > 0; i--)
		{
			var temp = ls[index];
			ls[index] = ls[index + 1];
			ls[index + 1] = temp;
		}
	}
	
	public void GenarateRandomAssets(List<float> assets, Random r, int size)
	{
		//Console.WriteLine("Here");
		for (var k = 0; k < size; k++)
		{
			//Console.WriteLine("Here333");
			assets.Add(RandomRangeFloat(10, r));
			//Console.WriteLine(assets[k]);
		}
	}
	
	public float RandomRangeFloat(int range, Random r)
	{
		return ((float)(r.NextDouble() * range));
	}
	
	public int RandomRangeInt(int range, Random r)
	{
		return ((int)(r.NextDouble() * range));
	}
}

public class Bin 
{
	private float capacity;
	private float currentCap = 0;
	private List<float> elements = new List<float>(1);
	private float score = 0f;
	
	public Bin(int size, float cap)
	{
		this.elements = new List<float>(size);
		this.capacity = cap;
	}
	
	public Bin(float cap)
	{
		this.elements = elements;
		this.capacity = cap;
	}
	
	public void AddElement(float element)
	{
		elements.Add(element);
		currentCap += element;
	}
	
	public void SetScore(float sc)
	{
		score = sc;
	}
	
	public float GetScore()
	{
		return (score);
	}
	
	public float GetCapacity()
	{
		return (capacity);
	}
	
	public float GetCurrentCap()
	{
		return (currentCap);
	}
	
	public void PrintElements()
	{
		for (var i = 0; i < elements.Count; i++)
		{
			Console.WriteLine(elements[i]);
		}
	}
	
	public int GetElementsLength()
	{
		return (elements.Count);
	}
	
	public float GetMem()
	{
		float memSum = 0f;
		for (var i = 0; i < elements.Count; i++)
		{
			memSum += elements[i];
		}
		return (memSum);
	}
}

​x
 
using System;
using System.Collections.Generic;
​
public class Program
{
    List<Bin> bins = new List<Bin>(1);
    List<float> assets = new List<float>(1);
    float epsilon = 10f;
    Random r = new Random();
    List<float> arr = new List<float>{1f, 3f, 4f, 5f, 2f};
    
    public static void Main()
    {
        Program instance_obj = new Program();
        instance_obj.GenarateRandomAssets(instance_obj.assets, instance_obj.r, 1000);
        //instance_obj.BinPack(instance_obj.assets);
        //Console.WriteLine(instance_obj.assets);
        //Console.WriteLine(instance_obj.assets.Count);
        //instance_obj.BinPack2(instance_obj.assets);
        instance_obj.BinPack3(instance_obj.assets);
        /*
        instance_obj.CycleElements2(instance_obj.arr);
        for (var i = 0; i < instance_obj.arr.Count; i++)
        {
            Console.WriteLine(instance_obj.arr[i]);
        }
        */
    }
    
    // First Fit Implementation with randomized picking
    public void BinPack(List<float> assets)
    {
        Bin b_i = new Bin(10f);
        bins.Add(b_i);
        
        for (var i = 0; i < assets.Count; i++)
        {
            if (assets[i] < (bins[0].GetCapacity() - bins[0].GetCurrentCap()))
            {
                bins[0].AddElement(assets[i]);
                //Console.WriteLine(bins[0].GetCurrentCap());
                //bins[0].PrintElements();
            }
            else 
            {
                Bin b_i2 = new Bin(10f);
                Bin b_ii = bins[0];
                bins.Remove(bins[0]);
                bins.Add(b_i2);
                bins.Add(b_ii);
            }
        }
        // Print Test Results
        //Console.WriteLine("The Number of Bins is " + bins.Count);
        //float avgBinMem = 0f;
        //float N = bins.Count;
        //float totMem = 0f;
        //for (var k = 0; k < bins.Count; k++)
        //{
        //  Console.WriteLine("Length of bin: " + k + " is " + bins[k].GetElementsLength());
        //  totMem += bins[k].GetMem();
        //}
        //avgBinMem = totMem / N;
        //Console.WriteLine("Average memory per bin is " + avgBinMem);
        
    }
    
    // Best Fit Implementation with randomized picking
    public void BinPack2(List<float> assets)
    {
        Bin b_i = new Bin(10f);
        bins.Add(b_i);
        
        for (var i = 0; i < assets.Count; i++)
        {
            if (assets[i] < (bins[0].GetCapacity() - bins[0].GetCurrentCap()))
            {
                //Console.WriteLine("What it do! Current cap is " + bins[0].GetCurrentCap());
                bins[0].AddElement(assets[i]);
                //Console.WriteLine(assets[i]);
                assets.Remove(i);
                //Console.WriteLine(bins[0].GetCurrentCap());
                //bins[0].PrintElements();
            }
            else 
            {
                if (bins.Count == 1)
                {
                    Console.WriteLine("We are here");
                    Bin b_i2 = new Bin(10f);
                    //Bin b_ii = bins[0];
                    //bins.Remove(bins[0]);
                    bins.Add(b_i2);
                    //bins.Add(b_ii);
                }
                else 
                {
                    //Console.WriteLine(" I am going mad!");
                    Bin b_i3 = new Bin(10f);
                    //Bin b_ii = bins[0];
                    //bins.Remove(bins[0]);
                    bins.Add(b_i3);
                    CycleElements3(bins);
                    //bins.Add(b_ii);
                }
            }
        }
        // Print Test Results
        Console.WriteLine("The Number of Bins is " + bins.Count);
        float avgBinMem = 0f;
        //float N = bins.Count;
        float N = 0;
        float totMem = 0f;
        
        for (var k = 0; k < bins.Count; k++)
        {
            if (bins[k].GetElementsLength() != 0)
            {
                N++;
            }
            
            Console.WriteLine("Length of bin: " + k + " is " + bins[k].GetElementsLength());
            totMem += bins[k].GetMem();
        }
        Console.WriteLine("The denominator N is " + N);
        avgBinMem = totMem / N;
        Console.WriteLine("Average memory per bin is " + avgBinMem);
        
    }
    
        // Nearest Fit Best Fit
    public void BinPack3(List<float> assets)
    {
        Bin b_i = new Bin(10f);
        bins.Add(b_i);
        
        for (var i = 0; i < assets.Count; i++)
        {
            if (assets[i] < (bins[0].GetCapacity() - bins[0].GetCurrentCap()))
            {
                //Console.WriteLine("What it do! Current cap is " + bins[0].GetCurrentCap());
                bins[0].AddElement(assets[i]);
                //Console.WriteLine(assets[i]);
                assets.Remove(i);
                //Console.WriteLine(bins[0].GetCurrentCap());
                //bins[0].PrintElements();
            }
            else 
            {
                // Find object closest to overflow and continue looking 
                float overflow = bins[0].GetCurrentCap() - bins[0].GetCapacity();
                float closest = 10000000;   // Arbitrarily large init point say inf
                for (var k = 0; k < assets.Count; k++)
                {
                    if (overflow - assets[k] < closest)
                    {
                        closest = assets[k];
                    }
                }
                bins[0].AddElement(closest);
                
                if (bins.Count == 1)
                {
                    Console.WriteLine("We are here");
                    Bin b_i2 = new Bin(10f);
                    //Bin b_ii = bins[0];
                    //bins.Remove(bins[0]);
                    bins.Add(b_i2);
                    //bins.Add(b_ii);
                }
                else 
                {
                    //Console.WriteLine(" I am going mad!");
                    Bin b_i3 = new Bin(10f);
                    //Bin b_ii = bins[0];
                    //bins.Remove(bins[0]);
                    bins.Add(b_i3);
                    CycleElements3(bins);
                    //bins.Add(b_ii);
                }
            }
        }
        // Print Test Results
        Console.WriteLine("The Number of Bins is " + bins.Count);
        float avgBinMem = 0f;
        //float N = bins.Count;
        float N = 0;
        float totMem = 0f;
        
        for (var k = 0; k < bins.Count; k++)
        {
            if (bins[k].GetElementsLength() != 0)
            {
                N++;
            }
            
            Console.WriteLine("Length of bin: " + k + " is " + bins[k].GetElementsLength());
            totMem += bins[k].GetMem();
        }
        Console.WriteLine("The denominator N is " + N);
        avgBinMem = totMem / N;
        Console.WriteLine("Average memory per bin is " + avgBinMem);
        
    }
    
    
    public void CycleElements2(List<float> ls)
    {
        var index = ls.Count-2;
        //int j = index;
        for (var i = index; i > 0; i--)
        {
            Console.WriteLine("AAA");
            //var temp = ls[index];
            var temp = ls[index];
            ls[index] = ls[i-1];
            ls[i-1] = temp;
        }
    }
    
    public void CycleElements3(List<Bin> ls)
    {
        var index = ls.Count-2;
        //int j = index;
        for (var i = index; i > 0; i--)
        {
            //Console.WriteLine("AAA");
            //var temp = ls[index];
            var temp = ls[index];
            ls[index] = ls[i-1];
            ls[i-1] = temp;
        }
    }
    
    public void CycleElements(List<Bin> ls)
    {
        var index = ls.Count-2;
        for (var i = index; i > 0; i--)
        {
            var temp = ls[index];
            ls[index] = ls[index + 1];
            ls[index + 1] = temp;
        }
    }
    
    public void GenarateRandomAssets(List<float> assets, Random r, int size)
    {
        //Console.WriteLine("Here");
        for (var k = 0; k < size; k++)
        {
            //Console.WriteLine("Here333");
            assets.Add(RandomRangeFloat(10, r));
            //Console.WriteLine(assets[k]);
        }
    }
    
    public float RandomRangeFloat(int range, Random r)
    {
        return ((float)(r.NextDouble() * range));
    }
    
    public int RandomRangeInt(int range, Random r)
    {
        return ((int)(r.NextDouble() * range));
    }
}
​
public class Bin 
{
    private float capacity;
    private float currentCap = 0;
    private List<float> elements = new List<float>(1);
    private float score = 0f;
    
    public Bin(int size, float cap)
    {
        this.elements = new List<float>(size);
        this.capacity = cap;
    }
    
    public Bin(float cap)
    {
        this.elements = elements;
        this.capacity = cap;
    }
    
    public void AddElement(float element)
    {
        elements.Add(element);
        currentCap += element;
    }
    
    public void SetScore(float sc)
    {
        score = sc;
    }
    
    public float GetScore()
    {
        return (score);
    }
    
    public float GetCapacity()
    {
        return (capacity);
    }
    
    public float GetCurrentCap()
    {
        return (currentCap);
    }
    
    public void PrintElements()
    {
        for (var i = 0; i < elements.Count; i++)
        {
            Console.WriteLine(elements[i]);
        }
    }
    
    public int GetElementsLength()
    {
        return (elements.Count);
    }
    
    public float GetMem()
    {
        float memSum = 0f;
        for (var i = 0; i < elements.Count; i++)
        {
            memSum += elements[i];
        }
        return (memSum);
    }
}

Compilation error (line 129, col 1): An object reference is required for the non-static field, method, or property 'Pet.setOldest()'
Compilation error (line 130, col 1): An object reference is required for the non-static field, method, or property 'Pet.setYoungest()'

Last Run:	3:08:05 am
Compile:	0s
Execute:	0.105s
Memory:	0b
CPU:	0s

View IL Code