Understanding Selection Sort: A Simple yet Inefficient Algorithm

📚🌃 Continuing my dive into data structures and algorithms. 🙂 🕸️ Tonight’s Focus: Chapter 20 – Graph Traversal (DFS & BFS) Unlike trees, graphs aren’t always hierarchical. They can be messy, interconnected, and unpredictable. So how do we explore them? With two trusty tools: Depth First 🐋 and Breadth First 🧭 Search ✅ FYI Graphs can represent anything from social networks to maps to recommendation systems We explore them to uncover all reachable nodes and understand their connections At the start, we only see one node. The rest are hidden until discovered ⚙️ Traversal Basics Each node goes through two phases Discovered Collection – Nodes are added here as soon as they’re found Explored Collection – Once all discovered neighbors of a node have been checked, the node moves here 🐋 Depth First Search (DFS) Uses a stack (Last In, First Out) Goes deep into one path before backtracking Newly discovered nodes are added to the beginning of the list Example path: A → B → C → E → F → G… 🧭 Breadth First Search (BFS) Uses a queue (First In, First Out) Explores level by level, checking all immediate neighbors before moving outward Newly discovered nodes are added to the end of the list Example path: A → B → C → D → E… ⚙️ Discovery Order DFS: Order depends on how neighbors are listed and pushed BFS: Order follows the queue. First discovered, first explored ⚡ Performance Time: O(n) Space: O(n) Same across best, average, and worst cases. Depends on graph size and structure 📚 These chapters are getting deeper. Might split them up going forward If you’re learning too (or just love emoji-powered breakdowns), follow along for more chapters in this series 🚀 #JavaScript #Algorithms #Coding #DevNotes

📚🌃 Continuing my dive into data structures and algorithms. 🙂 🫧 🔁 🫧 Tonight’s focus: Chapter 22: Bubble Sort ❌ Bubble Sort is one of the simplest sorting algorithms, but also one of the most inefficient. It’s often taught not because it’s fast, but to help you recognize and avoid sluggish 🐌 sorting patterns in your own code. ⚙️ How Bubble Sort Works -Start at the beginning of the list. -Compare each pair of adjacent elements. -If the first is greater than the second, swap them. -Move one step forward and repeat the comparison. -Once you reach the end, go back to the beginning and repeat the process. -Continue this cycle until all items are sorted. -When it runs a full pass with no swaps, the list is officially sorted. ✅ Key Notes -Its best-case scenario is a sorted list, ironically, the one time you don’t need a sort. -It’s slowest when the list is in reverse order because every element needs to be moved. ⚡🐢🐌 Performance -Time complexity: Worst and average case is O(n²). -Even small lists can take many steps, sorting 4 numbers might involve 8+ steps. -Requires multiple passes through the list. It will still pass through elements that have already been sorted, so it’s inefficient for large datasets. If you're learning too, or just love a good emoji-powered breakdown, follow along for more chapters in this series! 🚀 #JavaScript #Algorithms #Coding #DevNotes

📚🌃 Continuing my dive into data structures and algorithms. 🙂 🃏↪️🃏Tonight’s focus: Chapter 23: Insertion Sort Insertion Sort is like organizing cards 🃏 in your hand one at a time, you compare and place each card in its correct spot. ⚙️ How Insertion Sort Works -Start with the second item in the list (the first item is considered sorted). -Mark it as the active item. 📌 -Compare the active item to the items on its left (aka the sorted region). -Keep shifting left until you find a value smaller than the active item, then insert it to the right. -Repeat for each item in the unsorted region, reassigning the active item 📌 each time. ✅ Key Notes -Follows a “look left” approach: each new active item 📌 is compared to those before it, one by one, moving toward the first index, until it finds a value that is less than itself. ⚡ Performance -Time: O(n²) in the average and worst case. Best case (already sorted): O(n). -Space: Uses constant memory, no extra space needed. -Not ideal for large datasets, but useful when memory is limited, the list is mostly sorted. -Ok for small data sets. If you're learning too, or just love a good emoji-powered breakdown, follow along for more chapters in this series! 🚀 #JavaScript #Algorithms #Coding #DevNotes

📚🌃 Continuing my dive into data structures and algorithms. 🙂 🌳 Tonight’s Focus: Chapter 19 – Binary Tree Traversal In linear structures like arrays or linked lists, we move step-by-step: 0️⃣ ➡️ 1️⃣ ➡️ 2️⃣ ➡️ 3️⃣ But trees are hierarchical 🌳, so we use a different approach: Breadth-First 🔺 and Depth-First 🐋 Traversal ✅ FYI -Tree depth helps us understand how far a node is from the root -The goal is to visit every node and represent the full structure ⚙️ Traversal Basics Each node goes through two phases: Discovered Collection – We identify a node (starting from the root) and add it to this list as soon as it's found. Explored Collection – After a node is discovered, we examine its children. Once all its children have been discovered, we move the node to this list. 🔺 Breadth-First Traversal -Uses a queue (First In, First Out) -Visits nodes level by level, left to right, moving nodes from the discovered to explored collection as they are processed -Example order: A → B → C → D → E… 🐋 Depth-First Traversal -Uses a stack (Last In, First Out) -Nodes are discovered by traversing deep down the left-most path, then backtracked to the nearest unexplored node. During processing, nodes are moved from the discovered collection to the explored collection. ⚡ Performance Time: O(n) Space: O(n) Same across best, average, and worst cases 📚 Might just do half a chapter for the more involved chapters next. If you’re learning too (or just love emoji-powered breakdowns), follow along for more chapters in this series! 🚀 #JavaScript #Algorithms #Coding #DevNotes

𝑷𝒚𝒕𝒉𝒐𝒏 𝑳𝒊𝒃𝒓𝒂𝒓𝒊𝒆𝒔 & 𝑭𝒓𝒂𝒎𝒆𝒘𝒐𝒓𝒌𝒔 𝐍𝐮𝐦𝐏𝐲: Transform your data with high-performance numerical operations. 𝐏𝐚𝐧𝐝𝐚𝐬: Master data manipulation and analysis effortlessly. 𝐌𝐚𝐭𝐩𝐥𝐨𝐭𝐥𝐢𝐛: Visualize data like a pro with this versatile plotting library. 𝐑𝐞𝐪𝐮𝐞𝐬𝐭𝐬: Simplify HTTP requests for seamless API integration. 𝐅𝐥𝐚𝐬𝐤: Build robust web applications with this lightweight framework. 𝐃𝐣𝐚𝐧𝐠𝐨: Power up your web development projects with a full-fledged framework. 𝐁𝐞𝐚𝐮𝐭𝐢𝐟𝐮𝐥 𝐒𝐨𝐮𝐩: Web scraping made easy – parse HTML and XML effortlessly. 𝐓𝐞𝐧𝐬𝐨𝐫𝐅𝐥𝐨𝐰: Dive into machine learning with this open-source library. 𝐏𝐲𝐓𝐨𝐫𝐜𝐡: Empower your neural network projects with this dynamic library. 𝐒𝐜𝐢𝐤𝐢𝐭-𝐥𝐞𝐚𝐫𝐧: Implement efficient machine learning algorithms with ease. 𝐒𝐐𝐋𝐀𝐥𝐜𝐡𝐞𝐦𝐲: Craft SQL queries effortlessly with this SQL toolkit. 𝐅𝐚𝐬𝐭𝐀𝐏𝐈: Develop APIs quickly with high performance and auto-generated docs. 𝐂𝐞𝐥𝐞𝐫𝐲: Supercharge your Python apps with distributed task queues. 𝐏𝐲𝐠𝐚𝐦𝐞: Unleash your creativity by building games with this library. 𝐓𝐰𝐢𝐬𝐭𝐞𝐝: Develop event-driven networking applications seamlessly. Credit - thealpha 𝐅𝐨𝐥𝐥𝐨𝐰 𝐮𝐬 𝐨𝐧 𝐈𝐧𝐬𝐭𝐚𝐠𝐫𝐚𝐦 👉🏻https://lnkd.in/ehA5ePqX 𝐅𝐨𝐥𝐥𝐨𝐰 𝐮𝐬 𝐨𝐧 𝐋𝐢𝐧𝐤𝐞𝐝𝐈𝐧 👉🏻 https://lnkd.in/e2sq98PN https://lnkd.in/e-9dJf8i 𝐅𝐨𝐥𝐥𝐨𝐰 𝐮𝐬 𝐨𝐧 𝐅𝐚𝐜𝐞𝐛𝐨𝐨𝐤 👉🏻 https://lnkd.in/eWcXVwAt

📚🌃 Continuing my dive into data structures and algorithms. 🙂 📌➗ Tonight’s focus: Chapter 21 – Quicksort Quick Recap: Quicksort is one of the fastest sorting algorithms. It’s popular because it handles large datasets efficiently using a divide-and-conquer strategy. ⚙️ How Quicksort Works -Pick a 📌 pivot element from the array -Partition the array so that: -Elements less than the pivot go to the left -Elements greater than the pivot go to the right -Recursively apply the same logic to the left and right subarrays -Repeat until all regions are sorted ✅ Key Notes -The 📌 pivot element acts as a center point, elements are thrown left or right based on comparison -Once all values around a pivot are placed, that pivot is considered sorted -Choosing a good pivot is crucial since poor choices can lead to performance issues -Not stable meaning it doesn’t guarantee that equal elements will stay in their original order after sorting ⚡ Performance -Best/Average Case: O(n log n) - when partitions are balanced -Worst Case: O(n²) - when partitions are highly unbalanced (for example already sorted data) -To avoid worst-case scenarios, it's recommended to shuffle the array before sorting -Space Complexity: O(log n) 🌍 Real-World Use -Most programming languages have their own built-in and optimized version of Quicksort -You likely won’t need to implement it from scratch unless you're working with custom data structures If you're learning too, or just love a good emoji-powered breakdown, follow along for more chapters in this series! 🚀 #JavaScript #Algorithms #Coding #DevNotes

🤖 Machine Learning Project 2 📚Book Recommendation! ✅ Step 1: Data Loading & Inspection First, I loaded the three separate datasets: Books.csv, Users.csv, and Ratings.csv. I immediately checked their shapes, finding missing data and checking for duplicates. ✅ Step 2: Model 1 - Popularity-Based Recommender My first goal was to create a general "Top 50" list, perfect for new users. I merged the ratings and books tables. I grouped them to find the total ratings and average rating for each book. To ensure statistical significance, I filtered for books with 200 or more ratings. Finally, I sorted this filtered list by average rating to get my Top 50. ✅ Step 3: Model 2 - Collaborative Filtering Recommender This is where the personalization comes in. My process was: A) Filtering: To build a robust model, I filtered the data to include only users who had rated 150+ books and only books that had 50+ ratings. This is critical for reducing noise. B) Creating the Pivot Table: I pivoted the filtered data to create a user-item matrix, with book titles as the index, user IDs as the columns, and the ratings as the values. C) Filling Null Value: This matrix was very sparse, so I filled all NaN values (where a user hadn't rated a book) with 0. D) Calculating Similarity: I used scikit-learn's Cosine Similarity on this matrix. This powerful function calculated the similarity "score" between every book based on who rated them. E) Building the recommend Function: Finally, I built a function that takes a book title, finds its vector in the similarity matrix, and returns the top 5 most similar books. This project was a great exercise in: 🔹 Following a clear data pipeline (load, clean, filter, model). 🔹 Building different models for different use cases (new users vs. known users). 🔹 Matrix manipulation as the core of collaborative filtering. Github Repo: https://lnkd.in/dMZc-QQJ #DataScience #MachineLearning #Python #RecommendationSystem #CollaborativeFiltering #Pandas #ScikitLearn #DataAnalysis #Projects

Just shared a new article about how to build a secure, offline (air-gapped) vector search setup using Elasticsearch — and transform it into a real enterprise-grade Vector Database. Here’s what I covered: 💡 Uploading ML models like sentence-transformers/all-MiniLM-L12-v2 with Eland ⚙️ Building ingest pipelines to automatically create embeddings 📦 Setting up dense_vector mappings for semantic search fields 🔍 Running k-NN vector queries to find results by meaning 🔒 Designing for air-gapped (offline) environments — key for security and compliance This setup shows how companies can move beyond keyword search and build systems that truly understand context and intent — even without internet access. 👉 Read the full article here:

✨ Deepnote: A Smarter, Modern Alternative to Jupyter Notebooks Deepnote is quickly becoming a drop-in replacement for Jupyter — but with a modern, AI-first twist. If you work in data science, ML, analytics, or notebooks, this is worth knowing 👇 Here’s what makes Deepnote stand out: 🚀 AI-first Design – Built with AI assistance at the core 🎨 Modern & Sleek UI – Cleaner and more intuitive than Jupyter 📦 New Block-based Notebook Experience – Mix code, visuals, text, and components effortlessly 🔌 Native Data Integrations – Connect to databases, warehouses, and tools instantly 🧠 Multi-Language Support – Use Python, R, and SQL together without hacks And the best part? You can start locally in your favorite IDE … then scale up: ☁️ Run in Deepnote’s cloud 🤝 Collaborate in real time with teammates 🧑💻 Use Deepnote Agent for AI-powered insights 📲 Turn notebooks into deployable data apps If you're still stuck on classic Jupyter, this might be the upgrade your workflow needs. 🔗 Check it out: https://deepnote.com