Login
Discover
Waves
Communities
Write
Login
Signup
beatricearapoc
@beatricearapoc
31
Followers
1
Following
0
Follow
Email digest
Resource Credits
Available
Used
Created
2023-08-10 11:54
RSS Feed
Subscribe
Blog
Blog
Posts
Comments
Communities
Wallet
beatricearapoc
honouree
3y
Quick Sort: An Efficient Comparison-Based Sorting Algorithm
The quick sort algorithm is an efficient sorting algorithm that compares the elements. This sorting algorithm uses a "divide and conquer" method wherein there will be a chosen "pivot"
$ 0.032
4
beatricearapoc
honouree
3y
A Non-Comparative Sorting Algorithm: Counting Sort
Counting sort is a non-comparative sorting algorithm that is efficient. In the counting sort algorithm, it counts the number of occurrences of every unique element in the array. These number of occurrences
$ 0.033
6
1
beatricearapoc
honouree
3y
How the Selection Sort Algorithm Works
Similar to the bubble sort and insertion sort algorithms, the selection sort algorithm is a comparison-based sorting algorithm. The selection sort algorithm divides the array or list into two portions:
beatricearapoc
honouree
3y
Bubble Sort: A Comparison-Based Sorting Algorithm
One of the comparison - based sorting algorithms is the Bubble Sort. Basically, in bubble sort, it compares two adjacent elements. Once compared, the bubble sort algorithm will sort them if they are in
beatricearapoc
honouree
3y
Introduction to the Heap: A Binary Tree-Based Data Structure
Heap is a binary tree-based data structure that is utilized to retrieve the maximum or minimum element in a collection of data based on the type of heap used. As this is a tree data structure, there will
beatricearapoc
honouree
3y
Another Type of Linear Data Structure: Queues
One of the linear data structures in Java is the Queues. Queues follow the FIFO principle or the First In and First Out, unlike another linear data structure called stacks, which follow the LIFO principle
beatricearapoc
honouree
3y
Dynamic Storing of Elements through Linked Lists
One more way to store elements of data is through linked lists. Linked lists are linear data structures that consist of nodes. The nodes in these linked lists have elements and references to the next node.
beatricearapoc
honouree
3y
Nodes as Building Blocks for other Data Structures
Nodes are one of the data structures that act as containers of data. They can serve as building blocks or the basis by providing the means of establishing relationships between the elements in the node.
beatricearapoc
honouree
3y
Representing Collections of Data through Stacks
One of the ways of representing a collection of data is through stack. Stack is a data structure that follows the "LIFO" concept, which means last in, first out. This means that the recently
beatricearapoc
honouree
3y
Data Encryption: Encrypting and Decrypting Data in Java
Encrypting and decrypting data is something that I have always been curious about. As data is a valuable resource in today's society, it is essential to know how to protect it from people who do not have
beatricearapoc
honouree
3y
Activity 4
The primary programming language for this subject, Data Structures and Algorithms, is Java. Classes started with downloading and installing an IDE called Visual Studio Code and the Java JDK package. This