Patreon ► https://patreon.com/thecherno
Twitter ► https://twitter.com/thecherno
Instagram ► https://instagram.com/thecherno
Discord ► https://thecherno.com/discord

Series Playlist ► https://thecherno.com/cpp

Thank you to the following Patreon supporters:
- Samuel Egger
- Dominic Pace
- Kevin Gregory Agwaze
- Sébastien Bervoets
- Tobias Humig

Gear I use:
-----------------
BEST laptop for programming! ► http://geni.us/pakTES
My FAVOURITE keyboard for programming! ► http://geni.us/zNhB
FAVOURITE monitors for programming! ► http://geni.us/Ig6KBq

MAIN Camera ► http://geni.us/t6xyDRO
MAIN Lens ► http://geni.us/xGoDWT
Second Camera ► http://geni.us/CYUQ
Microphone ► http://geni.us/wqO6g7K

лектор: Хирьянов Тимофей Фёдорович
Прочитана 28.11.2017

Темы, рассмотренные на лекции:
- исключения в С++

What is C programming language? C is middle-level programming language which was developed at Bell Lab in 1972 by Dennis Ritchie. C language combines the features of Low level as well as High-level La

What is a Graph Algorithm?
Graph algorithms are a set of instructions that traverse (visits nodes of a)
graph.

Some algorithms are used to find a specific node or the path between two given
nodes.

Why Graph Algorithms are Important
Graphs are very useful data structures which can be to model various problems.
These algorithms have direct applications on Social Networking sites, State
Machine modeling and many more.

Some Common Graph Algorithms
Some of the most common graph algorithms are:

*

Observer pattern is a very commonly used pattern. In fact, it is so common that is being standardized in many programming…

Support Simple Snippets by Donations -
Google Pay UPI ID - tanmaysakpal11@okicici
PayPal - paypal.me/tanmaysakpal11
--------------------------------------------------------------------------------------------- Yes we are starting with Data structures and algorithms tutorials course since it was pending from a long time. In this video tutorial we will take an overview of this course where I will describe about the details and prerequisites of this course.
DS and algos Course Details -
Data structures & algorithms course is for anyone and everyone who wishes to understand what are data structures and how algorithms work. Specially gear for computer science and information technology students.
This course will include –
1) Theory & algorithms
Understand the working of DS and algorithms that operate on them.
Visualize Data Structures in the form of diagrams & DRY-RUN algorithms step by step to understand working
2) Practical Implementation (Programs) –
Implement the DS and algorithms in the form of computer programs…

What is a Search Algorithm?This kind of algorithm looks at the problem of re-arranging an array of items in ascending order. The two most classical examples of that is the binary search and the merge sort algorithm. Exponential SearchExponential Search, also known as finger search, searches for an element

Support Simple Snippets by Donations -
Google Pay UPI ID - tanmaysakpal11@okicici
PayPal - paypal.me/tanmaysakpal11
--------------------------------------------------------------------------------------------- In this tutorial we will study what is Big O notation & Time complexity of algorithms in data structures. We will first understand what is Algorithm analysis & then move on to Asymptotic Algorithm Analysis.
We will also understand WHY we need algorithm analysis in the first place & what are the metrics that quality an algorithm to be better than other.
Lastly we will understand what is Big O notation or Big O complexity of algorithms & its importance. We will also understand how to calculate the time complexity (Big O complexity) ourselves.

Simple Snippets Official Website -
http://simplesnippets.tech/
Simple Snippets on Facebook -
https://www.facebook.com/simplesnippets/
Simple Snippets on Instagram -
https://www.instagram.com/simplesnippets/
Simple Snippets on Twitter -
https://twitter.com/simplesnippet…

This is a quick-guide to mastering one of the most commonly used design patterns, the Abstract Factory. Even though the coding examples…

Patreon ► https://patreon.com/thecherno
Twitter ► https://twitter.com/thecherno
Instagram ► https://instagram.com/thecherno
Slack ► https://slack.thecherno.com

Constants ► https://youtu.be/4fJBrditnJU

Series Playlist ► https://www.youtube.com/playlist?list=PLlrATfBNZ98dudnM48yfGUldqGD0S4FFb

Gear I use:
-----------------
BEST laptop for programming! ► http://geni.us/pakTES
My FAVOURITE keyboard for programming! ► http://geni.us/zNhB
FAVOURITE monitors for programming! ► http://geni.us/Ig6KBq

MAIN Camera ► http://geni.us/t6xyDRO
MAIN Lens ► http://geni.us/xGoDWT
Second Camera ► http://geni.us/CYUQ
Microphone ► http://geni.us/wqO6g7K

Support Simple Snippets by Donations -
Google Pay UPI ID - tanmaysakpal11@okicici
PayPal - paypal.me/tanmaysakpal11
--------------------------------------------------------------------------------------------- Understand the concept of Space complexity of algorithms and how to calculate space complexity.
Definition: The space complexity of an algorithm or a computer program is the amount of memory space required to solve an instance of the computational problem as a function of the size of the input.
Simple words : It is the memory required by an algorithm to execute a program and produce output.
Similar to time complexity, Space complexity is often expressed asymptotically in big O notation, such as O(n), O(nlog(n)), O(n^2) etc., where n is the input size in units of bits needed to represent the input.
For any algorithm, memory is required for the following purposes -
1) To store program instructions.
2) To store constant values.
3) To store variable values.
4) And for few other things like function calls,…

For this topic you must know about Greatest Common Divisor (GCD) and the MOD operation first. Greatest Common Divisor (GCD)The GCD of two or more integers is the largest integer that divides each of the integers such that their remainder is zero. Example- GCD of 20, 30 = 10  (10

На докладе мы поговорили о недавней встрече комитета по стандартизации C++, обсудили самые приятные фиксы и неожиданные новинки... Но большую часть времени у...

Пара слов к вопросу об эффективном заполнении массивов одинаковыми значениями и о том, почему нельзя слепо доверять компиляторам.

Поделитесь лучшими. Какие платформы вам больше всего нравятся по подаче материала? Получаете ли сертификаты? По каким темам не хватает материала?