This week, I focused on understanding the Merge Sort algorithm and how the divide and conquer strategy works in practice. From the lecture video, I learned that Merge Sort repeatedly splits an array into two halves until each subarray has only one element, which is already sorted. The key step is the merge operation, where two sorted subarrays are combined by comparing elements and placing them in order. Using the recurrence relation T(n) = 2T(n/2) + Θ(n) and applying the Master Theorem, I learned that the overall time complexity of Merge Sort is Θ(n log n). This helped me connect the algorithm steps with formal time-complexity analysis.
My educational goal in the Computer Science program is to become a skilled software engineer who can design and build innovative, efficient software solutions using both strong programming skills and AI tools responsibly. I want to complete my degree with a solid understanding of core computer science principles, such as algorithms, data structures, and system design, so I can solve complex problems without relying only on AI. After graduation, I aim to work on projects that improve people’s lives by combining creativity and technology, constantly learning new skills to stay ahead in the fast-changing tech world. This goal excites me because I see myself growing as a confident, adaptable developer who uses both traditional knowledge and AI to create a meaningful impact. My career goal is to be a software engineer who makes intelligent and helpful technology for people. I want to work at a company that uses AI and new tools carefully and responsibly. I want to grow as a leader who helps...
Comments
Post a Comment