0
iValue is a company that provides IT solutions and services.
Wiki User
∙ 10y ago
Add your answer:
Earn +20 pts
Ivalue of a 38 special rossi 4122?
50-175 USD
What is the algorithm for inserting values into a queue in c plus plus?
A queue usually infers first in first out (FIFO), therefore new values will need to be inserted after the last node (the tail node) and the queue must maintain pointers to both the head node for extraction and the tail node for insertion, and each node must maintain a pointer to the next node in the queue (singly-linked list). The following code provides a bare-bones implementation of a singly-linked FIFO list, where each value is an integer. In real-life you'd use one of the built-in class templates, otherwise you'd have to re-write the same code to cater for all the different value types you might want to place in a queue (or create your own class template). However, the example serves to show the algorithm that is used to insert new values to the end of a queue. It does not show how to extract the first node from the queue. #include <iostream> using namespace std; class Node { public: Node( int iValue ):m_iValue( iValue ),m_pNext( NULL ){} ~Node(){ if( m_pNext ) delete m_pNext; } Node * GetNext()const{ return m_pNext; } void SetNext(Node * pNext ){ m_pNext = pNext; } int GetValue()const{ return m_iValue; } private: Node * m_pNext; int m_iValue; }; class Queue { public: Queue():m_pFirst(NULL),m_pLast(NULL){} ~Queue(){ if( m_pFirst ) delete m_pFirst; } Node * GetFirst()const{ return m_pFirst; } Node * GetLast()const{ return m_pLast; } void Insert( int iValue ); void ShowAll()const; private: Node * m_pFirst; Node * m_pLast; }; void Queue::Insert( int iValue ) { Node * pNew = new Node( iValue ); if( m_pLast ) m_pLast->SetNext( pNew ); else m_pFirst = pNew; m_pLast = pNew; } void Queue::ShowAll() const { Node * pNode = m_pFirst; while( pNode ) { cout << pNode->GetValue(); if( pNode != m_pLast ) cout << ", "; pNode = pNode->GetNext(); } cout << endl << endl; } int main() { Queue queue; queue.Insert( 2 ); queue.Insert( 1 ); queue.Insert( 3 ); queue.ShowAll(); return( 0 ); }
What is Charles Simonyi's contribution to computer programming?
Charles Simonyi developed the Hungarian notation convention, where variables are named in order to automatically reveal their type, which is particularly useful in untyped languages. For instance, a variable named iValue signifies the value is an integer, while lpcszName signifies the name is a far pointer to a constant null-terminate string. A variable named m_iData signifies the data is an integer and also a class member. While at Xerox PARC in 1972 he assisted in the development of the Xerox Alto, an early form of PC. He also assisted in the development of Bravo, a WYSIWYG document preparation program. In 1977 he received his PhD from Stanford with a dissertation on metaprogramming, a software project management technique. He joined Microsoft in 1981 and oversaw the development of Microsoft Word and Excel, and eventually Office. He introduced Microsoft to his Hungarian notation which is widely used throughout all Microsoft software. He left Microsoft in 2002 to co-found Intentional Software which markets intentional programming concepts. He was awarded the Wharton Infosys Business Transformation Award in 2004 for his innovative work in information technology. For more information, see related links, below.
