Quant Researcher at Algorithm Trading/Computer Science NSIT/Competitive Coding

Shaksham Garg

This course is about array and matrix and covers various operations carried on them like access, insertion, deletion etc. Also each lesson has corresponding time complexity analysis for the algorithm. This course will help the learners in building their concepts on 1 dimensional and 2 dimensional arrays.

Programming

English

Data Structures and Algorithms: Array and Matrix

Programming Languages

Competitive Programming

Arrays & Strings

Basics

Personal and Skill Development

Develop your coding skills, learn a new language or prepare for campus placements and job interviews, you can do it all with these awesome courses.

This lesson is about introduction to array an 2d array. 
This lesson includes operation description for access to an element, insertion of an element, deletion of an element, searching for an element.

Introduction to Arrays

This lesson is about 2d matrix operations. 
The lesson includes addition, subtraction, transpose of 2d matrix.

Matrix Operations: Addition, Subtraction, Transpose

The lesson is about 2d matrix operations. 

The lesson includes description and algorithm for multiplication of two matrices

Matrix Operation: Multiplication, Inner Product, Outer Product

This lesson is matrix multiplication operation. 

The lesson includes strassen matrix multiplication algorithm and compares Strassens’s method with normal matrix multiplication.

Strassen Matrix Multiplication

This lesson is about Determinant of matrix. 

The lesson discusses about how to obtain determinant using cofactor for a general nxn matrix.

Matrix Operation: Determinant

The lesson is about Adjoint and inverse of matrix. 

The lesson discusses about general formula for finding adjoint using cofactor matrix and for finding inverse using determinant and adjoint matrix.

Matrix Operation: Inverse of Matrix

Lesson is on introduction to pointers. 
The lesson tells about representation of variables in memory and use of address operator.

Pointers:Introduction

Lesson is about pointers in c++ and includes examples of pointers.

Pointers example

The lesson is about References variables in c++ and difference between reference variables and pointers.

Reference variables

Pointer to 1d array

Lesson is about pointers to two dimensional array.

Pointer to 2d array

Lesson is about dynamic memory allocation. 
The lesson also explains the difference between dynamic and static memory allocation.

Dynamic objects

Lesson is about dynamic memory allocation for 2d array.

Dynamic memory allocation for 2d array.

A passionate teacher, a tech-geek, a versatile web developer, an aviation enthusiast and also a B.Tech Computer Science student.

Samyak Jain

This course covers various searching and sorting mechanisms in arrays in C++.

Programming Fundamentals - Searching and Sorting Methods in Arrays

A computer science graduate with keen interest in machine learning, artificial intelligence and other technologies and in history.

Akash Gupta

In this course, the educator discusses all the aspects of competitive programming and shall cover the various functions and libraries of STL in C++.

Introduction to Competitive Programming with STL

hlo guys!! myself arpitakaushal I live in ayoudhya .

Arpita Kaushal

In this course, the educator is discussing array in c programming for Programming aspirants

(Hindi) Array in C Programming Language

CSE Engineer. Tech. Enthusiast. Hard Worker and Problem Solver.

Vivek Seth

This course discusses how sorting algorithms work - selecting the best algorithm for a particular task, calculating each algorithm's complexity (time and space) in order to effectively use them etc.

(Hindi) Advanced Sorting Algorithms

Student studying in VIT university, Pursuing undergrad in IT(information tech),
loves to code and teach.

Kusumanchi Vineeth

In this course, Kusumanchi Vineeth has discussed Data Structures. He has covered bubble sort, merging the sorting list, algorithm for bubble sorting, examples, advantages and disadvantages.

Bubble Sort in Data Structures

This series aims to take your programming to the next level. The series focuses on aspiring programmers who aim to be better at coding.

Hackerearth Inc.

The collection begins with an indispensable searching algorithm, Binary Search and tries to get a basic understanding of where it can be used. The next two lessons solve problems for the important application of Binary Search in Competitive Programming. In these two lessons, one can Binary Search for the answer in a range of values and learn how to exploit the behavior of a variable.

Lessons

13 lessons • 2h 16m

Invalid Date

NaN

Introduction to Arrays

Invalid Date

NaN

Matrix Operations: Addition, Subtraction, Transpose

Invalid Date

NaN

Matrix Operation: Multiplication, Inner Product, Outer Product

Invalid Date

NaN

Strassen Matrix Multiplication

Invalid Date

NaN

Matrix Operation: Determinant

Invalid Date

NaN

Matrix Operation: Inverse of Matrix

Invalid Date

NaN

Pointers:Introduction

Invalid Date

NaN

Pointers example

Invalid Date

NaN

Reference variables

Invalid Date

NaN

Pointer to 1d array

+ See all lessons