Skip to main content

Basic Structure of a C++ program | C++ tutorial

Today we will see how we will write C++ programs. and try to understand some basic concept of C++ in detail. so let's write a program in C++. and then we will understand the meaning of each and every line of our program.

Our first C++ program:

#include<iostream>
using namespace std;

int main(){

cout<<"hello C++"<<endl;

}

so let's understand the structure of our program.
the very first line is :
#include<iostream>
so basically what it is?
#include is a preprocessor directive that tells it to paste in the contents of the header file into the stream of C++ code that is fed to the compiler.

iostream stands for standard input output stream. this is basically a header file, inside this file there are different kind of functions and classes, which we use in our programs. this header file makes us able to send and receive data.

second line is:
using namespace std;
this line declares that classes and functions of the standard library can be used directly in the code. if you don't write this line then  the structure of code will get change and now you have to write the same program like this:
#include<iostream>
int main(){
std:cout<<"hello C++"<<endl;
}

third line is:
int main()
it is a function named "main". we will learn about function later. till now just understand that every program must have a main() function.

int main() means there is function named "main", whose return type is "int". we will see all these things in detail. so don't be panic.

next line is:
cout<<"hello C++"<<endl;

this line will print hello C++ on the screen after executing the code. so to print any thing on screen we will use cout<<thing which we want to print<<endl;

endl means end of line.

basically cout is an object(we will learn about object later). which is used for send output to the screen.

Output:



Comments

Popular posts from this blog

Basics of C++ | C++ Tutorial

This is our first tutorial on C++. and there are a lot of features in C++. but we will focus on those part which is beneficial for competitive programming. and after learning new concept we will solve some questions related to those concepts, so that we can use these concepts to solve bigger problems. First of all let's get some theoritical knowledge about C++: 1.C++ is an Object Oriented Programming language(we will explain this point later). 2.It is developed by Bjarne Stroustrup in 1979. 3.C++ is high level language.     What is High level language?      ->they are those language which is machine independent, that means we can compile or run it on any machine.     ->Easy to debug and maintain.     ->Portable. so if any language has these features then we can consider it as a High level language.       eg:C++, Java etc.. 4.C++ provides data security. 5.Main features of C++ is Polymorphism, I...

Array vs Linked List

Benefits of Linked List over Array: 1.Deletion and Insertion:  -> Deletion and Insertion in linked is less time consuming over array.    Deletion: if we delete any element from array except last element, then we have to shift all element backward       after the deleted element. so suppose we have an array of 10 integers and if we delete element from index five, then we have to shift element from index 6 to 9 backward. and it will consume more time. while deletion in list is less time consuming. we will see it later. Insertion: if we insert an element in the array except last index, then  we have to shift the remaining element after that index towards right. and it will take more time. while insertion in linked list is much profitable than array. 2.We can dynamically increase the size of the linked list as we allocate memory to nodes at runtime(or dynamically). while in case of array we have to declare it size during writing of code. ...

Symmetric Tree | Interview Problem

Introduction: In this tutorial we are going to solve a good question which will clear your doubts on how BFS or level order traversal is useful to solve binary tree problems. this is basically a question from Leetcode, and it is really very good problem to practice BFS. Problem Statement: Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center). For example, this binary tree [1,2,2,3,4,4,3] is symmetric: But the following [1,2,2,null,3,null,3] is not: Link : Leetcode Link please make binary tree on paper by the given array above. and you will get a clear picture of the problem. what we are going to do in this problem. Solution: As we know we are going to apply BFS to solve this problem. actually you have to just get one thing to solve this problem. we will perform BFS, but with little change or modification. So first we will store the root->val in a vector or array of the left subtree. and during this we will first insert left child and then ...