<?xml version="1.0" encoding="UTF-8"?><rss xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:atom="http://www.w3.org/2005/Atom" version="2.0" xmlns:cc="http://cyber.law.harvard.edu/rss/creativeCommonsRssModule.html">
    <channel>
        <title><![CDATA[Stories by JHUTAN BARMAN on Medium]]></title>
        <description><![CDATA[Stories by JHUTAN BARMAN on Medium]]></description>
        <link>https://medium.com/@jhutanda?source=rss-3b9ad38257f0------2</link>
        <image>
            <url>https://cdn-images-1.medium.com/fit/c/150/150/1*vrZ3iqpxIKMW0-_yQc1qbQ.jpeg</url>
            <title>Stories by JHUTAN BARMAN on Medium</title>
            <link>https://medium.com/@jhutanda?source=rss-3b9ad38257f0------2</link>
        </image>
        <generator>Medium</generator>
        <lastBuildDate>Sun, 22 Nov 2026 16:48:55 GMT</lastBuildDate>
        <atom:link href="https://medium.com/@jhutanda/feed" rel="self" type="application/rss+xml"/>
        <webMaster><![CDATA[yourfriends@medium.com]]></webMaster>
        <atom:link href="http://medium.superfeedr.com/" rel="hub"/>
        <item>
            <title><![CDATA[Building El Nino Forecast Hub with Medo.dev]]></title>
            <link>https://medium.com/@jhutanda/building-el-nino-forecast-hub-with-medo-dev-3c3c6de83e9f?source=rss-3b9ad38257f0------2</link>
            <guid isPermaLink="false">https://medium.com/p/3c3c6de83e9f</guid>
            <dc:creator><![CDATA[JHUTAN BARMAN]]></dc:creator>
            <pubDate>Sun, 17 May 2026 06:09:46 GMT</pubDate>
            <atom:updated>2026-05-17T06:09:46.715Z</atom:updated>
            <content:encoded><![CDATA[<figure><img alt="" src="https://cdn-images-1.medium.com/max/614/1*hVzrh54-BRqwkX5KFI9SoA.png" /></figure><p>Climate change and extreme weather events are becoming more serious every year, especially for agriculture and vulnerable communities. To help people understand and prepare for these climate changes, I built <a href="https://app-bcz9v0uar7cx.appmedo.com/"><strong>El Nino Forecast Hub</strong></a>, an AI-powered platform focused on El Niño forecasting, environmental analysis, and agriculture guidance.</p><p>The project provides climate insights, impact analysis, and practical recommendations that can help users prepare for droughts, floods, heatwaves, and changing weather conditions caused by El Niño events.</p><p>One of the biggest advantages during development was using <a href="https://medo.dev/">Medo.dev</a>. The platform helped speed up the development process by simplifying frontend workflows, improving project organization, and making experimentation easier. Instead of spending too much time on setup and repetitive development tasks, I was able to focus more on climate data visualization, forecasting logic, and user experience.</p><p>Using <a href="https://medo.dev/">Medo.dev</a> allowed faster prototyping, smoother development, and better productivity while building the platform. It helped transform the idea into a working climate intelligence project more efficiently.</p><p>El Nino Forecast Hub represents a step toward accessible climate technology that can support smarter environmental and agricultural decision-making in the future.</p><p>#BuiltWithMeDo</p><p>See the project: <a href="https://app-bcz9v0uar7cx.appmedo.com/">El Nino Forecast Hub</a></p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=3c3c6de83e9f" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Types of shorting algorithms in DSA?]]></title>
            <link>https://medium.com/@jhutanda/types-of-shorting-algorithms-in-dsa-42bda948efdc?source=rss-3b9ad38257f0------2</link>
            <guid isPermaLink="false">https://medium.com/p/42bda948efdc</guid>
            <category><![CDATA[sorting-algorithms]]></category>
            <category><![CDATA[data-structures]]></category>
            <category><![CDATA[algorithms]]></category>
            <dc:creator><![CDATA[JHUTAN BARMAN]]></dc:creator>
            <pubDate>Sun, 27 Aug 2023 17:27:45 GMT</pubDate>
            <atom:updated>2023-08-27T17:27:45.162Z</atom:updated>
            <content:encoded><![CDATA[<figure><img alt="" src="https://cdn-images-1.medium.com/max/259/1*bkVK1Lgg2Z-dPHJ25-TXdg.png" /><figcaption>Types of shorting algorithms in DSA?</figcaption></figure><p><strong>S</strong>orting algorithms are used to arrange elements in a specific order, such as ascending or descending. There are various sorting algorithms with different time and space complexities. Here are some of the common sorting algorithms:</p><ol><li><strong>Bubble Sort:</strong> This is a simple comparison-based sorting algorithm where adjacent elements are compared and swapped if they are in the wrong order. It repeats this process until the entire array is sorted.</li><li><strong>Selection Sort:</strong> In this algorithm, the smallest (or largest) element is repeatedly selected from the unsorted part of the array and swapped with the leftmost (or rightmost) element in the unsorted part.</li><li><strong>Insertion Sort:</strong> Elements from the unsorted part of the array are picked and placed at the correct position in the sorted part of the array, making it grow incrementally.</li><li><strong>Merge Sort:</strong> This is a divide-and-conquer algorithm that divides the array into two halves, sorts them recursively, and then merges the two sorted halves.</li><li><strong>Quick Sort</strong>: Another divide-and-conquer algorithm where a pivot element is chosen and the array is partitioned into two sub-arrays — elements less than the pivot and elements greater than the pivot. The sub-arrays are then recursively sorted.</li><li><strong>Heap Sort:</strong> This algorithm uses the concept of a binary heap to build a max-heap or min-heap and then repeatedly extracts the root element (which is the largest or smallest) and restores the heap property.</li><li><strong>Counting Sort</strong>: This is a non-comparison-based sorting algorithm that works well when the range of elements is known. It counts the occurrences of each element and then places them in order.</li><li><strong>Radix Sort:</strong> Radix sort is a non-comparison-based sorting algorithm that sorts integers by processing individual digits. It sorts numbers by their individual digits from the least significant digit to the most significant digit.</li><li><strong>Bucket Sort</strong>: This is also a non-comparison-based sorting algorithm that distributes elements into a number of buckets based on their values and then sorts the elements within each bucket.</li><li><strong>Tim Sort:</strong> Tim Sort is a hybrid sorting algorithm derived from merge sort and insertion sort. It has the advantage of being stable and has good performance on many kinds of real-world data.</li></ol><p>These are some of the most common sorting algorithms used in DSA. The choice of which algorithm to use depends on factors like the size of the dataset, the distribution of data, and the available resources.</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=42bda948efdc" width="1" height="1" alt="">]]></content:encoded>
        </item>
    </channel>
</rss>