HashTable implemented using quadratic probing for collision resolution

Posted on Leave a commentPosted in Uncategorized

Using quadratic probing for collision resolution #define ERROR_TABLE_FULL -1 #define ERROR_RECORD_NOT_FOUND -1 #define ERROR_DUPLICATE_RECORD -1   class HashTable{ public: HashTable(int table_size); int insert(const string &record); int retrieve(const string &record); private: int hash(const string &record); int hash_size; int record_count; string* table; };   /** * Constructor accepting table_size */ HashTable::HashTable(int table_size){ hash_size = table_size; table = […]

HashTable implemented using linear probing for collision resolution

Posted on Leave a commentPosted in Uncategorized

Using linear probing for collision resolution in hashtable   #define ERROR_TABLE_FULL -1 #define ERROR_RECORD_NOT_FOUND -1 #define ERROR_DUPLICATE_RECORD -1   class HashTable{ public: HashTable(int table_size); int insert(const string &record); int retrieve(const string &record);   private: int hash(const string &record); int hash_size; int record_count; string* table; };   /** * Constructor accepting table_size */ HashTable::HashTable(int table_size){ hash_size […]

Quicksort implementation using Linked List

Posted on Leave a commentPosted in Uncategorized

About QuickSort Wikipedia QuickSort definition. General idea revolves around partitioning a list where values less than pivot go into left list while greater than go into right list. Pivot here is the first item of the passed in list. We apply this recursively to the sublists them merge left+pivot+right. CPP Code First of all not […]