Algorithm code implementation in Java – Search, Sort, Graph

搜索、排序、图表中重要算法的Java代码实现，每个算法的逻辑解释

您将学习什么
算法的 Java 实现，例如图、搜索、排序
图的实现逻辑、搜索、排序
算法 在竞争性编程考试和面试中编写
复杂算法 调试复杂算法逻辑

要求
需要基本的 java 编码知识

描述
Graph、Sorting、Searching 等重要算法的代码实现。代码已用 Java 语言实现。算法实现将在以下领域有所帮助：-

面试——如今，算法已成为面试官最喜欢的话题。因此，您必须事先准备好流行的算法逻辑及其代码实现。

Hackerrank、Hackerearth、Codechef 等的竞争性编程考试。

在大学或学校考试中，算法问题经常被问到。

在课程中，每个算法的逻辑在进入代码之前都会通过示例进行解释，以便您更好地理解代码。课程中讨论的一些算法是：-

搜索

线性搜索

二进制搜索

排序

选择排序

冒泡排序

快速排序

图算法

BFS – 广度优先搜索

Dijkstra 算法

通过逐步调试代码完成了对算法的解释。您还将学习如何以简单的方式调试复杂的代码。

该课程旨在更多地关注编码部分，而不是理论。已使用适当的示例清楚地解释了每种算法的概念。

本课程由在竞争性编码和面试方面拥有多年经验的专家创建

如果您在学习过程中有任何疑问，可以在评论中问我，我会以最好的方式回答您的问题。

Published 05/2022
MP4 | Video: h264, 1280×720 | Audio: AAC, 44.1 KHz, 2 Ch
Genre: eLearning | Language: English + srt | Duration: 8 lectures (1h 31m) | Size: 836.1 MB

Java Code implementation of important algorithms in searching, sorting, graph with logic explanation of each algorithm

What you’ll learn
Java implementation of algorithms such as Graph, searching, sorting
Logic of implementation of graph, searching, sorting algorithms
Code the complex algorithms in competitive programming exams and interviews
Debug complex algorithms logic

Requirements
Basic java coding knowledge is required

Description
Code implementation of important algorithms such as Graph, Sorting, Searching. The code has been implemented in Java language. The algorithms implementation will be helpful in following areas :-

Interviews – Now a days, algorithms have become a favorite topic for interviewers. So you must be prepared with the popular algorithms logic and their code implementation beforehand.

Competitive programming exams on Hackerrank, Hackerearth, Codechef etc.

In college or school exams algorithms questions are asked frequently.

In the course, each algorithm’s logic is explained with the help of example before moving onto code, so that you can understand the code better. Some of the algorithms discussed in the course are :-

Searching

Linear Search

Binary Search

Sorting

Selection sort

Bubble sort

Quicksort

Graph Algorithms

BFS – Breadth First Search

Dijkstra Algorithm

The explanation of the algorithms have been done by debugging the code step by step. You will also learn how to debug complex codes in an easy manner.

The course has been designed to concentrate more on coding part and less on theory. The concept of each algorithm has been explained clearly using appropriate examples.

This course has been created by experts who have many years of experience in competitive coding and interviews

If you have any doubts while studying the course you can ask me in the comments, I will reply to your questions in the best way possible.

Who this course is for
Developers who want to understand popular Algorithms concept and their code implementation in Java language