Yahoo Finance API in Python 3.2

This is a sample code to fetch market data from yahoo finance.

import urllib.request

class YahooFinance:
    yahoo_tags = {
'a':'Ask',
'b':'Bid',
#'b4':'Book Value',  ##
'c1':'Change',
#'c8':'After Hours Change (Real-time)', ##
'd2':'Trade Date',
#'e7':'EPS Estimate Current Year', ##
#'f6':'Float Shares', ##
'j':'52-week Low',
#'g3':'Annualized Gain', ## 
#'g6':'Holdings Gain (Real-time)',## 
#'j1':'Market Capitalization',##
'j5':'Change From 52-week Low',
#'k2':'Change Percent (Real-time)', ##
'k5':'Percebt Change From 52-week High',
#'l2':'High Limit', ##
#'m2':"Day's Range (Real-time)", ##
#'m5':'Change From 200-day Moving Average', #not required
#'m8':'Percent Change From 50-day Moving Average', #not required
'o':'Open',
'p2':'Change in Percent',
'q':'Ex-Dividend Date',
#'r2':'P/E Ratio (Real-time)', ##
#'r7':'Price/EPS Estimate Next Year', ##
#'s7':'Short Ratio', ##
#'t7':'Ticker Trend', ##
#'v1':'Holdings Value', ##
#'w1':"Day's Value Change", #not required
#'y':'Dividend Yield',##
#'b6':'Bid Size', #-----Bug
#'c3':'Commission',##
#'d':'Dividend/Share',##
#'e':'Earnings/Share',##
#'e8':'EPS Estimate Next Year',##
'g':"Day's Low",
'k':'52-week High',
#'g4':'Holdings Gain', ##
#'i':'More Info',
#'j3':'Market Cap (Real-time)', ##
'j6':'Percent Change From 52-week Low',
'k3':'Last Trade Size',
#'l':'Last Trade (With Time)',
#'l3':'Low Limit',
#'m3':'50-day Moving Average',
#'m6':'Percent Change From 200-day Moving Average',
#'n':'Name', ##
'p':'Previous Close',
#'p5':'Price/Sales',
#'r':'P/E Ratio',
#'r5':'PEG Ratio',
's':'Symbol',
't1':'Last Trade Time',
#'t8':'1 yr Target Price',
#'v7':'Holdings Value (Real-time)',
#'w4':"Day's Value Change (Real-time)",
#'c':'Change & Percent Change',
#'c6':'Change (Real-time)',
'd1':'Last Trade Date',
#'e1':'Error Indication (returned for symbol changed / invalid)',
#'e9':'EPS Estimate Next Quarter',
'h':"Day's High",
#'g1':'Holdings Gain Percent',
#'g5':'Holdings Gain Percent (Real-time)',
#'i5':'Order Book (Real-time)',
#'j4':'EBITDA',
#'k1':'Last Trade (Real-time) With Time',
'k4':'Change From 52-week High',
'l1':'Last Trade (Price Only)',
#'m':"Day's Range",
#'m4':'200-day Moving Average',
#'m7':'Change From 50-day Moving Average',
#'n4':'Notes',
#'p1':'Price Paid',
#'p6':'Price/Book',
#'r1':'Dividend Pay Date',
#'r6':'Price/EPS Estimate Current Year',
#'s1':'Shares Owned',
#'t6':'Trade Links',
'v':'Volume',
#'w':'52-week Range',
'x':'Stock Exchange'
}

    quote_list = ['Ask','Bid','Change','Trade Date','52-week Low',
                  'Change From 52-week Low','Percebt Change From 52-week High',
                  'Open','Change in Percent','Ex-Dividend Date',"Day's Low",
                  '52-week High','Percent Change From 52-week Low','Last Trade Size',
                  'Previous Close','Symbol','Last Trade Time','Last Trade Date',
                  "Day's High",'Change From 52-week High','Last Trade (Price Only)',
                  'Volume','Stock Exchange']

    def __init__(self, symbol, debug_flg = False):
        self.symbol = symbol
        self.req_header = ""
        self.req_value = ""
        self.res_data = []
        self.res_value = []
        self.mkt_data = {}
        self.debug_flg = debug_flg

        for key in YahooFinance.yahoo_tags :
            self.req_header += key + "#|"
            self.req_value += YahooFinance.yahoo_tags[key] + "#|"

        if debug_flg :
            print (self.req_header)
            print (self.req_value)
        
    def request(self):
        header = "".join(self.req_header.split("#|"))
        url = 'http://finance.yahoo.com/d/quotes.csv?s=%s&f=%s' % (self.symbol,header)
        return str(urllib.request.urlopen(url).read(), encoding='utf8')

    def process(self):
        self.res_data = self.request().split(',')
        self.res_value = self.req_value.split("#|")
        self.mkt_data = dict(zip(self.res_value, self.res_data))

        #for k in mkt_data:
        #    print (k, "=>", mkt_data[k])

    def show(self):
        if len(self.mkt_data) == 0:
            print ("Error ...data is not fetched")
        else:
            for k in YahooFinance.quote_list:
                print (k, " => ", self.mkt_data[k])
        
 

ab = YahooFinance('HINDALCO.NS')
ab.process()
ab.show()

Output :-

Unsorted :
Ask  =>  117.25
Bid  =>  116.25
Change  =>  -3.60
Trade Date  =>  -
52-week Low  =>  111.20
Change From 52-week Low  =>  +5.05
Percebt Change From 52-week High  =>  -48.28%
Open  =>  120.65
Change in Percent  =>  "-3.00%"
Ex-Dividend Date  =>  "14-Sep-11"
Day's Low  =>  115.55
52-week High  =>  224.75
Percent Change From 52-week Low  =>  +4.54%
Last Trade Size  =>  1
Previous Close  =>  119.85
Symbol  =>  "HINDALCO.NS"
Last Trade Time  =>  "6:29am"
Last Trade Date  =>  "4/26/2012"
Day's High  =>  121.15
Change From 52-week High  =>  -108.50
Last Trade (Price Only)  =>  116.25
Volume  =>  10257747
Stock Exchange  =>  "NSE"

Recursive Merge Sort in C++

#include <iostream>
#include <vector>
#include <iterator>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <ctime>

#define ARR_SIZE 15

using namespace std;

void print(vector<int> &vt)
{
    copy(vt.begin(), vt.end(), ostream_iterator<int>(cout, "  "));
    cout<<endl;
}

void merge(vector<int> &vt, int p, int r)
{
    int mid = floor((p+r)/2);
    int i1 = 0;
    int i2 = p;
    int i3 = mid + 1;

    vector<int> t_vt;
    t_vt.reserve(r-p+1);

    while( i2 <= mid && i3 <= r)
    {
        if ( vt[i2] < vt[i3] )
            t_vt[i1++] = vt[i2++];
        else
            t_vt[i1++] = vt[i3++];
    }

    while (i2 <= mid )
        t_vt[i1++] = vt[i2++];

    while ( i3 <= r )
        t_vt[i1++] = vt[i3++];

    for(int i = p; i <= r; i++)
        vt[i] = t_vt[i-p];

}

/*Algorithm
    1> Split the list into two equal parts at the middle
    2> Apply merge_sort() on each list
    3> Merge both the lists
*/
void merge_sort(vector<int> &vt, int p, int r)
{
    if(p<r)
    {
        int mid = floor((p+r)/2);
        merge_sort(vt, p, mid);
        merge_sort(vt, mid+1, r);
        merge(vt, p, r);
    }
}

int main()
{
    vector<int> vt;
    vt.reserve(ARR_SIZE);

    srand(time(NULL));

    for(int i=0; i<ARR_SIZE; i++)
        vt.push_back(rand()%1000);

    cout<<"Unsorted : "<<endl;
    print(vt);

    merge_sort(vt, 0, vt.size()-1);

    cout<<"Sorted : "<<endl;
    print(vt);

    return 0;
}

Output :-

Unsorted :
308  259  354  738  444  7  891  756  63  56  460  961  732  38  648
Sorted :
7  38  56  63  259  308  354  444  460  648  732  738  756  891  961

Union and Intersection of two Linked Lists in C++

#include <iostream>

using namespace std;

class LinkedList
{
    //Linked List Node
    struct node
    {
        int data;
        node *next;
    };

    //Header Node that points to linked list
    node* header;

    //Utility Function to free memory allocated to the nodes
    void freeMemory()
    {
        node * t;
        while(header != NULL)
        {
            t = header;
            header = header->next;
            delete t;
        }
        header = NULL;
    }

    //Utility Function to check the presence any data in the list
    bool isPresent(int data)
    {
        node *t = header;

        while ( t != NULL )
        {
            if(data == t->data )
                return true;
            t = t->next;
        }

        return false;
    }

public:
    //Default Constructor
    LinkedList():header(NULL) {}

    //Copy Constructor
    LinkedList(const LinkedList &cp)
    {
        node *t = cp.header, *t2;
        header = NULL;
        while(t != NULL)
        {
            t2 = new node;
            t2->data = t->data;
            t2->next = header;
            header = t2;
            t = t->next;
        }

    }

    //Overloaded Assignment Operator
    LinkedList& operator=(const LinkedList &cp)
    {
        if(&cp == this)
            return *this;
        //LinkedList();
        freeMemory();
        node *t = cp.header, *t2;
        header = NULL;
        while(t != NULL)
        {
            t2 = new node;
            t2->data = t->data;
            t2->next = header;
            header = t2;
            t = t->next;
        }

        return *this;

    }

    //Destructor
    ~LinkedList()
    {
        node * t;
        while(header != NULL)
        {
            t = header;
            header = header->next;
            delete t;
        }
        header = NULL;
    }

    //Function that adds element to linked list
    void push(int data)
    {
        node *t = new node;
        t->next = header;
        t->data = data;
        header = t;
    }

    //Displays the linked list in console
    void printList()
    {
        node *t = header;
        while(t != NULL)
        {
            cout<<t->data<<"  ";
            t = t->next;
        }
        cout<<endl;
    }

    //Union Function
    /*
    Algorithim
    1> Create an empty List.
    2> Traverse list1 and add all of its elements to the result.
    3> Traverse list2. If an element of list2 is already present
       in result then do not insert it to result, otherwise insert.
    Time Complexity : O(mn) m is the number of elements in first
       list and n is the number of elements in second list.
    */
    LinkedList unionList(LinkedList list2)
    {
        node *t1= header, *t2 = list2.header;
        LinkedList result;

        while(t1 != NULL)
        {
            result.push(t1->data);
            t1 = t1->next;
        }

        while(t2 != NULL)
        {
            if(!result.isPresent(t2->data))
                result.push(t2->data);
            t2 = t2->next;
        }

        return result;

    }

    //Intersection Function
    /*Algorithim
    1> Create an Empty List.
    2> Traverse list1 and look for its each element in list2,
       if the element is present in list2, then add the element to result
    Time Complexity : O(mn) m is the number of elements in first
       list and n is the number of elements in second list.
    */
    LinkedList intersectList(LinkedList list2)
    {
        node *t1= header;
        LinkedList result;

        while(t1 != NULL)
        {
            if(list2.isPresent(t1->data))
                result.push(t1->data);
            t1 = t1->next;
        }

        return result;
    }

};

int main()
{
    LinkedList list1;
    list1.push(10);
    list1.push(30);
    list1.push(12);
    list1.push(19);
    list1.push(78);
    cout<<"List1 : ";
    list1.printList();

    LinkedList list2;
    list2.push(30);
    list2.push(121);
    list2.push(19);
    list2.push(89);
    cout<<"List2 : ";
    list2.printList();

    LinkedList listUnion = list1.unionList(list2);
    cout<<"Union List : ";
    listUnion.printList();

    LinkedList listIntersect = list1.intersectList(list2);
    cout<<"Intercestion List : ";
    listIntersect.printList();


    return 0;
}

Output :-

List1 : 78  19  12  30  10
List2 : 89  19  121  30
Union List : 89  121  10  30  12  19  78
Intercestion List : 30  19

non-type template-parameter

A non-type template-parameter shall have one of the following (optionally cv-qualified) types:

• integral or enumeration type,
• pointer to object or pointer to function,
• lvalue reference to object or lvalue reference to function,
• pointer to member,
• std::nullptr_t.