Other Entries by Bobby Foerster (from psc cd).

Search Results: Page 1 of 1 found. Entries 1 - 2 of 2 found
  Description
Compatibility
Level/
Author
Views/
Date
Submitted
User Rating
 
  Address Book (Dictionary ADT) with HashingAddress Book (Dictionary ADT) with HashingC++ (general), Microsoft Visual C++, Borland C++, UNIX C++Intermediate /
Bobby Foerster (from psc cd)
1392 since
1/1/2015 10:36:00 PM

By 4 Users

       This code is an example implementation of the standard Dictionary ADT. It is implemented as an Address book that uses hashing(instead of a basic sequential search) so that add, search, and delete should run with a Big-O value of O(1) or at least close to ...(description truncated)
 
 
  Chess: 8 queens solution-- using a stackChess: 8 queens solution-- using a stackC++ (general), Microsoft Visual C++, UNIX C++Intermediate /
Bobby Foerster (from psc cd)
4739 since
1/2/2015 12:55:00 AM

By 4 Users

       Goal Write a stack-based program that solves a variation of the classic “Eight Queens” problem. Background In chess, the Queen is the most powerful piece in terms of attacking and defending. A Queen can move as far as she can in ...(description truncated)
 


Search Results: Page 1 of 1 found. Entries 1 - 2 of 2 found

Compatibility Filter Profile:

C
C++ (general)
Microsoft Visual C++
Borland C++
UNIX C++