/*
 * MyGroceryList.java
 *
 * Created: February 27, 2005
 * Modified by:
 * Description: MyGroceryList class for Programming Assignment 4
 * CS111 A1 Spring 2005
 */

package program4;

public class MyGroceryList {
    
    private static final int MAX_ITEMS = 200;
    private GroceryItem[] groceries;
    private int numItems;
    
    /** Creates a new instance of MyGroceryList */
    public MyGroceryList() {
        groceries = new GroceryItem[MAX_ITEMS];
        numItems = 0;
    }
    
    /** put a new item on the grocery list */
    public void addItem(String name, int quantity, int unitPrice){
        if(numItems < MAX_ITEMS - 1)
            groceries[numItems++] = new GroceryItem(name, quantity, unitPrice);
        return;
    }
    
    /** print out all items on list, in order */
    public void output(){
        if(numItems == 0){
            System.out.println("Empty list");
            return;
        }
           
        for(int i=0;i<numItems;++i){
            System.out.println(groceries[i].getName() + ", " +
                                " Quantity: " + groceries[i].getQuantity() + 
                                " Unit Price: " + groceries[i].getUnitPrice());
        }
        return;
    }
    
    // Methods you write:
    
    // find item by name on the list -- case insensitive
    public GroceryItem getItem(String name){
        // returns a reference to the item if found.
        
        // otherwise, returns null
        return null;
    }
    
    // find the most expensive item on the list
    // returns item, or null if no items on list
    public GroceryItem getMostExpensive(){
       // returns reference to the most expensive item
       // (in terms of unit cost)
        
        // if no items on list, return null
        return null;
    }
    
    // compute the total cost of items on the list
    // if no items on list, return 0
    public int getTotalCost(){
        // returns the total cost of all items on the list
        // be sure to multiply unitCost x quantity!
        int cost = 0;
        
        // write your code here
        
        return cost;
    }
    
    // Sort the items in the list to put them in alphabetical order
    // The sorting is case insensitive, starting with A and ending with Z.
    // You are welcome to adapt the Selection Sort algorithm given in the textbook.
    public MyGroceryList sortAlphabeticalOrder(){
        MyGroceryList alphaList = new MyGroceryList();
        
        // returns a new grocery list sorted in alphabetical order
        
        // if list is empty, returns empty list
        return alphaList;
    }
}