Data Structure Algorithm

603

Stories

436

Writers

Deepanshi sharma

·1 day ago

Dive Deep into Quicksort

Sorting is considered to be the most fundamental problem in the study of algorithms as it is used everywhere. There is a huge number of sorting algorithms out there, From insertion sort to merge sort all have its pros and cons depending on the size of input and other factors…

Programming

6 min read

All About Code

·1 day ago

In C++, create a method to compute the average of an array using pointers

Question Create a method that have 2 parameters. The first parameter is an array of the data type ‘double’ called scores. The second parameter is an ‘int’ of the number of scores, the length of the array. Explanation Within the method ‘computeAverage’, first initialize a pointer called ‘ptr’ to point to the…

Cpp

2 min read

Isha Sharma

·5 days ago

Vectors C++ CheatSheet

Arrays hold values of the same type at contiguous memory locations. Vectors are basically dynamic arrays. Advantages Store multiple values of same type in 1 variable Access is O(1) if index is known Disadvantages Insertion/Deletion from the middle of the array is difficult because remaining elements needs to be shifted to accommodate…

Vector

2 min read

Pratiyush Prakash

Dev Genius

·6 days ago

DSA | Kahn’s algorithm for Topological sorting

This article is a part of Data structure and algorithm series. In this series I will try to explain important and tricky Data structure and Algorithm topics in detail. In this article I will cover Kahn’s algorithm for Topological sorting. Definition First let’s understand what is topology sorting anyway. define: topological…

Data Structure Algorithm

5 min read

DSA | Kahn’s algorithm for Topological sorting

D3KRYPT_ToT

·6 days ago

Bitwise XOR( ^ )- Most Used Bitwise Operator. Why? (Part-1)

The bitwise XOR ( ^ ) is one of the most used operator(concept) in the Bit Manipulation techniques. The Bitwise XOR, like other Bitwise operator, takes two equal length bit patterns and performs the logical operation on them. If both the bits are same then, the result is an Unset…

Bit Manipulation

3 min read

Graph and Tree Traversal | DFS & BFS — Swift

Let’s learn graph traversal using DFS and BFS algorithm — In my last tutorial, I discussed some fundamental knowledge of graphs. Today I will discuss using two famous graph or tree traversal algorithms. I never faced any situation where I had to implement graph traversal algorithms in my professional career. …

Swift

5 min read

Syed Nabeel Sharafat

·May 8

How to get your first job as a Computer Science Graduate

It is my first article on Medium and there could be some mistakes in it, so please ignore them. Stick with me for a few minutes, if you are from a computer science or computer engineering background you will find this article quite useful. My Story First of all, let me share…

Computer Science

4 min read

Prachi Jamdade

·May 3

An Interesting Interview Problem on Linked List

Hey All 👋, I’m back with another article. Currently, I’m solving problems on Linked List. And Linked List is my favorite data structure 😅. Let's talk about Linked List. Here are some applications of Linked List in the real world — Previous and Next Page in Web Browser : We…

Linked Lists

2 min read

An Interesting Interview Problem on Linked List

Mohammed Boussardi

·May 3

Deleting a Node from Binary Search Tree

To help you understand, we will use various examples. These examples will help you better understand the topic. To delete a key in any data structure, you must first find it in the data structure. Next, delete the node that contains the key. …

Binary Search Tree

3 min read

All About Code

·May 2

In C++, write a method called findDifference that returns the position of the first corresponding elements of two arrays that are not equal.

Question int findDifference(const string a1[], int n1, const string a2[], int n2); Return the position of the first corresponding elements of a1 and a2 that are not equal. n1 is the number of interesting elements in a1, and n2 is the number of interesting elements in a2. If the arrays are…

Programming

1 min read

Data Structure Algorithm

Dive Deep into Quicksort

In C++, create a method to compute the average of an array using pointers

Vectors C++ CheatSheet

DSA | Kahn’s algorithm for Topological sorting

Bitwise XOR( ^ )- Most Used Bitwise Operator. Why? (Part-1)

Graph and Tree Traversal | DFS & BFS — Swift

How to get your first job as a Computer Science Graduate

An Interesting Interview Problem on Linked List

Deleting a Node from Binary Search Tree

In C++, write a method called findDifference that returns the position of the first corresponding elements of two arrays that are not equal.

603

436

Related Topics

Top Writers

The Code Panda

Mahmud Ahsan

Pratiyush Prakash

All About Code

Palistha