DSA: Heap
A heap is a specialized tree-based data structure that satisfies the heap property. It is commonly used to implement priority queues and efficient sorting algorithms like heap sort.
June 10, 2023 | Algorithm, Data Structure | No comments
Mule 4: Multipart/form-data in HTTP Request Connector
Multipart/Form-Data service using the HTTP Request connector in Mule 4
May 24, 2023 | Mule 4 | No comments
Mule 4: HTTP request connector
the HTTP Request connector is a powerful component that allows you to send HTTP requests and receive responses from external systems or APIs
May 23, 2023 | Mule 4 | No comments
Introduction to Singly Linked List
Singly Linked List Singly Linked List is a linear and connected data structure made of Nodes. Each node is composed of a variable data where its content (actual value) is stored and a pointer to the next Node (next node location) on the list. The Linked List has a pointer to the first element of this Node […]
March 27, 2022 | Data Structure | No comments
Batch Processing in Mule 4.0
batch processing provides a construct for asynchronously processing larger-than-memory data sets that are split into individual records.
December 9, 2021 | python | No comments
What is Dataweave
DataWeave is a programming language designed for transforming data. It is MuleSoft’s primary language for data transformation, as well as the expression language used to configure components and connectors.
July 4, 2021 | Dataweave | No comments
Linear Search or Sequential Search in Python
sequential search is a method for finding an element within a list. It sequentially checks each element of the list until a match is found or the whole list has been searched.
Implementation of a Hash Table in Python
The idea of a dictionary used as a hash table to get and retrieve items using keys is often referred to as a mapping. Python already has a built-in dictionary object that serves as a Hash Table.
Implementation of Shell Sort in Python
The shell sort improves on the insertion sort by breaking the original list into a number of smaller sub-lists, each of which is sorted using an insertion sort.
Implementation of Selection Sort in Python
The selection sort improves on the bubble sort by making only one exchange for every pass through the list.