-
Notifications
You must be signed in to change notification settings - Fork 78
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Fix Intro bundle. #78
base: master
Are you sure you want to change the base?
Conversation
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
The overleaf link does not allow me to left comments on the document.
I have comments about the changes can be made on the document, I can comment on where you should review/change
$$|f(x)| \leq Mg(x)\ for \ all\ x\ such\ that\ x_0 \leq x$$ | ||
In many contexts, the assumption that we are interested in the growth rate as the variable x goes to infinity is left unstated, and one writes more simply that: | ||
In many contexts, the assumption that we are interested in the growth rate as the variable $x$ goes to infinity is left unstated, and one writes more simply that: |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
I think this sentences is verry complex, it can be simplified
priority_queue<int> pq; | ||
|
||
for(int i = 0 ; i < 5 ; i ++){ | ||
pq.push(i); |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
this looks like stack implementation, not PQ implementation. You should put more complex code in here,
instead of 0 to 5. putting random values, works better.
https://www.geeksforgeeks.org/efficient-way-to-initialize-a-priority-queue/
cout << pq.top() << " "; | ||
pq.pop(); | ||
} | ||
// 4 3 2 1 0 |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
// 4 3 2 1 0 | |
// Output: 4 3 2 1 0 |
@@ -635,14 +634,35 @@ \subsection{Vectors} | |||
\subsection{Stacks, Queues, and Deques} | |||
|
|||
\textbf{C++:} They are no different than stack, queue and deque we already know. It provides the implementation, you can simply include the libraries and use them. See \href{http://www.cplusplus.com/reference/queue/queue/}{queue}, \href{http://www.cplusplus.com/reference/stack/stack/}{stack}, \href{http://www.cplusplus.com/reference/deque/deque/}{deque} | |||
|
|||
\subsection{Priority Queues} |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
\subsection{Priority Queues} | |
\subsection{Priority Queues & Heaps} |
Overleaf link: https://www.overleaf.com/read/vnvpgnprgmnk