--- title: "Teja Illa (@akaDurga) | Hashnode" description: "Teja Illa (@akaDurga) writes on Hashnode. Read their latest articles and follow their work." url: "https://hashnode.com/@akaDurga" --- @akaDurga # Teja Illa @akaDurga · Joined June 2023 ### [Topological Sort Algorithm](https://akadurga.hashnode.dev/topological-sort-algorithm?utm_source=hashnode&utm_medium=feed) Topological sort algorithm using DFS import java.util.\*; public class Main { public static class Graph { int v; int e; List> arrList; public Graph(int v, int e) { this.v = v; this.e = e; arrList... 1 min read · [akadurga.hashnode.dev](https://akadurga.hashnode.dev/topological-sort-algorithm?utm_source=hashnode&utm_medium=feed) [Oct 2, 2024](https://hashnode.com/posts/topological-sort-algorithm/66fcea12a383b6595888fb4f) ### [Djikstra Algorithm in Java](https://akadurga.hashnode.dev/djikstra-algorithm-in-java?utm_source=hashnode&utm_medium=feed) Djikstra Algorithm in Java import java.util.\*; public class Main { public static class Node implements Comparable { public int vertices; public int distance; public Node(int vertices, int distance) { this.vertices = vert... 1 min read · [akadurga.hashnode.dev](https://akadurga.hashnode.dev/djikstra-algorithm-in-java?utm_source=hashnode&utm_medium=feed) [Oct 2, 2024](https://hashnode.com/posts/djikstra-algorithm-in-java/66fce2ce929ff74018f1fbf5) ### [DFS and BFS on a Single Graph](https://akadurga.hashnode.dev/dfs-and-bfs-on-a-single-graph?utm_source=hashnode&utm_medium=feed) BFS and DFS Algorithm on a single Graph Take an Example of the below Graph import java.util.\*; public class Main { public static class Graph { int v; int e; List> arrList; public Graph(int v, int e) { this.v... 1 min read · [akadurga.hashnode.dev](https://akadurga.hashnode.dev/dfs-and-bfs-on-a-single-graph?utm_source=hashnode&utm_medium=feed) [Oct 2, 2024](https://hashnode.com/posts/dfs-and-bfs-on-a-single-graph/66fcd8aba5d4ecd39219e50c) ### [Quick Sort Algorithm :](https://akadurga.hashnode.dev/quick-sort-algorithm?utm_source=hashnode&utm_medium=feed) Quick sort Algorithm : Time Complexity : O(n\*log(n)) Space Complexity : O(1) Not a stable algorithm, Relative ordering of the elements is not guaranteed. import java.util.\*; public class Main { public static void main(String\[\] args) { int\[... 1 min read · [akadurga.hashnode.dev](https://akadurga.hashnode.dev/quick-sort-algorithm?utm_source=hashnode&utm_medium=feed) [Oct 2, 2024](https://hashnode.com/posts/quick-sort-algorithm/66fcc9ea9d26d334020b5340) ### [Syntax and basic things to brush up on before starting/restarting leetcode](https://akadurga.hashnode.dev/syntax-and-basic-things-to-brush-up-on-before-startingrestarting-leetcode?utm_source=hashnode&utm_medium=feed) Arrays int\[\] arr = new int\[10\]; System.out.println(arr.length); int\[\]\[\] arr2 = new int\[10\]\[10\]; System.out.println(arr2.length); System.out.println(arr2\[0\].length); Integer\[\] referenceArray = new Inte... 1 min read · [akadurga.hashnode.dev](https://akadurga.hashnode.dev/syntax-and-basic-things-to-brush-up-on-before-startingrestarting-leetcode?utm_source=hashnode&utm_medium=feed) [Oct 2, 2024](https://hashnode.com/posts/syntax-and-basic-things-to-brush-up-on-before-startingrestarting-leetcode/66fcc8dcd309a29ca37ecba3)