Explore the differences between these three top languages in relation to the maximum possible integer value.
Also find me here:
Baeldung Author
baeldung
This is the standard author on the site. Most articles are published by individual authors, with their own profiles, but when multiple people have a strong contribution, we publish collectively here.
Here's what I've written (so far):
Baeldung on Computer Science
- All
- Machine Learning (45)
- Algorithms (41)
- Networking (40)
- Programming (36)
- Math and Logic (30)
- OS (19)
- Computer Vision (19)
- Artificial Intelligence (19)
- Deep Learning (16)
- Trees (15)
- Data Structures (15)
- Security (14)
- Sorting (13)
- Latex (13)
- Software Architecture (11)
- Core Concepts (10)
- Graphs (8)
- Searching (6)
- Series (5)
- Web (4)
- Graph Traversal (4)
- Data Science (4)
- Path Finding (3)
- Graph Theory (3)
- Concurrency (1)
Go-Back-N Protocol
Filed under Networking
Learn how the Go-Back-N protocol works for both the sender and the receiver side to ensure reliable data transfer.
Divide and Conquer Algorithms
Filed under Algorithms
Explore the strategy of divide and conquer, with the use of recursion.
Fibonacci: Top-Down vs Bottom-Up Dynamic Programming
Filed under Algorithms, Programming
Learn how to compute numbers in the Fibonacci Series with a recursive approach and with two dynamic programming approaches.
Feature Scaling
Filed under Machine Learning
Learn how to apply feature scaling during the data transformation phase to improve Machine Learning results.
A Quick Guide to Binary Search Trees
Filed under Data Structures, Trees
A quick and practical guide to binary search trees.
Functional Programming
Filed under Programming
Learn the core concepts of the functional programming paradigm and how it compares to OOP.
Understanding Dimensions in CNNs
Filed under Artificial Intelligence
Learn how different dimensions are used in convolutional neural networks.
Finding the Lowest Common Ancestor of Two Nodes in a Binary Tree
Filed under Algorithms, Trees
Learn how to solve the Lowest Common Ancestor problem of two nodes in a binary tree.