Browse Library
Sign In Start Free Trial
Close icon Search icon
Account
Browse Library Sign In Start Free Trial

Add to playlist

Create a Playlist

Modal Close icon
You need to login to use this feature.
  • Book Overview & Buying Introduction to Data Structures & Algorithms in Java
  • Table Of Contents Toc
Introduction to Data Structures & Algorithms in Java

Introduction to Data Structures & Algorithms in Java

By : Raghavendra Dikshit
Buy this Video
close
close
Introduction to Data Structures & Algorithms in Java

Introduction to Data Structures & Algorithms in Java

By: Raghavendra Dikshit
Buy this Video

Overview of this book

This course introduces some basic data structures (arrays, linked lists, stacks, queues, trees and heaps) and algorithms (various sorting algorithms, and algorithms for operations on binary search trees and heaps). We will also cover recursion in this course. Use of graphics and animations makes the lectures very easy to understand and digest. After taking this course, you will loose your fear for data structures and algorithms.
Table of Contents (10 chapters)
close
close
close
1
Introduction to Algorithms
Icon
Introduction
Icon
Euclid's algorithm
Icon
Bubble Sort algorithm
Icon
Why study data structures & algorithms
Icon
Correctness of an algorithm
2
Analysis of Algorithms
chevron up
Icon
Introduction
Icon
How to calculate the time complexity
Icon
The RAM model of computation
Icon
Time complexity of Bubble sort algorithm
Icon
Pseudo code : Bubble sort algorithm
Icon
The Big O notation
Icon
Using Big O notation : Examples
Icon
Comparison of running times
3
Basic Sorting and Search Algorithms
Icon
Selection Sort
Icon
Selection Sort: Pseudocode
Icon
Introduction to Insertion Sort
Icon
Applying Insertion Sort algorithm to cue balls
Icon
Insertion Sort: Pseudocode
Icon
O(n²) sorting algorithms – Comparison
Icon
Stable Vs Unstable Sorts
Icon
Searching elements in an un ordered array
Icon
Searching elements in an ORDERED array
Icon
Searching elements in an ORDERED array - contd.
Icon
Inserting and Deleting items in an ORDERED array
Icon
Sorting any type of object
4
Linked Lists
Icon
What is a Linked List?
Icon
Implementing a Linked List in Java
Icon
Inserting a new Node
Icon
Length of a Linked List
Icon
Deleting the head node
Icon
Searching for an Item
Icon
Doubly Ended Lists
Icon
Inserting data in a sorted Linked List
Icon
Doubly Linked List
Icon
Insertion Sort revisited
5
Stacks and Queues
Icon
Stacks
Icon
Abstract Data Types
Icon
Implementing Stacks using Arrays
Icon
Queues
Icon
Queues using Arrays
Icon
Double Ended Queues
Icon
Double Ended Queues using Arrays
6
Recursion
Icon
Introduction
Icon
Understanding Recursion
Icon
Tail recursion
Icon
Tower of Hanoi
Icon
Tower of Hanoi – Implementation
Icon
Merge Sort
Icon
Merge Sort – Pseudocode
Icon
Merge Step – Pseudocode
Icon
Time Complexity of Merge Sort
7
Binary Search Trees
Icon
The Tree Data structure
Icon
Binary Trees
Icon
Binary Search Trees
Icon
Finding an item in a Binary Search Tree
Icon
Implementing the find method
Icon
Inserting an item in a Binary Search Tree
Icon
Deleting an Item: Case 1
Icon
Deleting an Item - Case 2
Icon
Deleting an Item - Case 3
Icon
Deleting an Item - Soft Delete
Icon
Finding smallest & largest values
Icon
Tree Traversal: In Order
Icon
Tree Traversal: Pre Order
Icon
Tree Traversal: Post Order
Icon
Unbalanced Trees Vs Balanced Trees
Icon
Height of a Binary Tree
Icon
Time Complexity of Operations on Binary Search Trees
8
More Sorting Algorithms
Icon
Introduction
Icon
QuickSort
Icon
QuickSort: The partition step
Icon
Shell Sort
Icon
Shell Sort Example
Icon
Counting Sort
Icon
Radix Sort
Icon
Bucket Sort
9
Heaps
Icon
Introduction
Icon
Deleting the Root
Icon
Inserting an item in a heap
Icon
Heaps as Priority Queues
Icon
Representing heaps using Arrays
Icon
Heap Sort
Icon
Building a heap
10
Hashtables
Icon
Introduction
Icon
Direct Access Tables
Icon
Hashing
Icon
Resolving collisions through chaining
Icon
The Hash function
Icon
Open Addressing to resolve collisions
Icon
Strategies for Open Addressing
Icon
Time Complexity: Open Addressing
Icon
Conclusion
You're currently viewing a free sample. Access the full title and Packt library for free now with a free trial.
Chapter: 2
Analysis of Algorithms
Icon This video is locked
Icon
Icon
0:00
2.0x
1.5x
1.25x
1.0x
0.5x
caption settings
caption off
Icon Icon
ShowHide Transcripts Icon
Section: 5
Pseudo code : Bubble sort algorithm
Analysis of Algorithms: Pseudo code : Bubble sort algorithm
CONTINUE WATCHING
83
Tech Concepts
36
Programming languages
73
Tech Tools
Icon Unlimited access to the largest independent learning library in tech of over 8,000 expert-authored tech books and videos.
Icon Innovative learning tools, including AI book assistants, code context explainers, and text-to-speech.
Icon 50+ new titles added per month and exclusive early access to books as they are being written.
Introduction to Data Structures & Algorithms in Java
End of Section 2
Next Section
notes
bookmark Notes and Bookmarks search Search in title playlist Add to playlist download Download options
font-size Font size

Change the font size

margin-width Margin width

Change margin width

day-mode Day/Sepia/Night Modes

Change background colour

Close icon Search
Country selected
Close icon Your notes and bookmarks

Confirmation

Modal Close icon
claim successful
Order Page Read Now

Buy this book with your credits?

Modal Close icon
Are you sure you want to buy this book with one of your credits?
Close
YES, BUY

Submit Your Feedback

Modal Close icon
Modal Close icon
Modal Close icon