Jonathan Irvin Gunawan, Nathan Azaria, Ian Leow Tze Wei, Nguyen Viet Dung, Nguyen Khac Tung, Steven Kester Yuwono, Cao Shengze, Mohan Jishnuįinal Year Project/UROP students 3 (Jun 2014-Apr 2015)įinal Year Project/UROP students 4 (Jun 2016-Dec 2017) Undergraduate Student Researchers 2 (May 2014-Jul 2014) Phan Thi Quynh Trang, Peter Phandi, Albert Millardo Tjindradinata, Nguyen Hoang Duyįinal Year Project/UROP students 2 (Jun 2013-Apr 2014)
Undergraduate Student Researchers 1 (Jul 2011-Apr 2012)įinal Year Project/UROP students 1 (Jul 2012-Dec 2013)
#BUBBLE LETTERS O SOFTWARE#
Project Leader & Advisor (Jul 2011-present)Īssociate Professor Steven Halim, School of Computing (SoC), National University of Singapore (NUS)ĭr Felix Halim, Senior Software Engineer, Google (Mountain View) Additionally, we have authored public notes about VisuAlgo in various languages, including Indonesian, Korean, Vietnamese, and Thai: id, VisuAlgo has been translated into three primary languages: English, Chinese, and Indonesian. Each VisuAlgo visualization module now includes its own online quiz component. By assigning a small (but non-zero) weight to passing the online quiz, CS instructors can significantly enhance their students' mastery of these basic concepts, as they have access to an almost unlimited number of practice questions that can be instantly verified before taking the online quiz.
#BUBBLE LETTERS O MANUAL#
As more CS instructors adopt this online quiz system worldwide, it could effectively eliminate manual basic data structure and algorithm questions from standard Computer Science exams in many universities. Questions are randomly generated based on specific rules, and students' answers are automatically graded upon submission to our grading server.
#BUBBLE LETTERS O GENERATOR#
At present, the platform features 24 visualization modules.Įquipped with a built-in question generator and answer verifier, VisuAlgo's "online quiz system" enables students to test their knowledge of basic data structures and algorithms. VisuAlgo remains a work in progress, with the ongoing development of more complex visualizations. However, since April 2022, a mobile (lite) version of VisuAlgo has been made available, making it possible to use a subset of VisuAlgo features on smartphone screens. For an optimal user experience, a minimum screen resolution of 1366x768 is recommended.
Initially, VisuAlgo was not designed for small touch screens like smartphones, as intricate algorithm visualizations required substantial pixel space and click-and-drag interactions. While primarily designed for National University of Singapore (NUS) students enrolled in various data structure and algorithm courses (e.g., CS1010/equivalent, CS2040/equivalent (including IT5003), CS3230, CS3233, and CS4234), VisuAlgo also serves as a valuable resource for inquisitive minds worldwide, promoting online learning. Suhendry Effendy - VisuAlgo remains the exclusive platform for visualizing and animating several of these complex algorithms even after a decade. Steven Halim's book, 'Competitive Programming' - co-authored with Dr. Initially conceived in 2011 by Associate Professor Steven Halim, VisuAlgo aimed to facilitate a deeper understanding of data structures and algorithms for his students by providing a self-paced, interactive learning platform.įeaturing numerous advanced algorithms discussed in Dr. The version presented in CLRS is stable, but is a bit more complex than this form. PS: This version of Counting Sort is not stable, as it does not actually remember the (input) ordering of duplicate integers. We will not be able to do the counting part of Counting Sort when k is relatively big due to memory limitation, as we need to store frequencies of those k integers. The time complexity of Counting Sort is thus O( N+k), which is O( N) if k is small. The time complexity is O( N) to count the frequencies and O( N+k) to print out the output in sorted order where k is the range of the input Integers, which is 9-1+1 = 9 in this example. , Integer 9 appears, and then loop through 1 to 9 to print out x copies of Integer y if frequency = x. Try Counting Sort on the example array above where all Integers are within, thus we just need to count how many times Integer 1 appears, Integer 2 appears. Assumption: If the items to be sorted are Integers with small range, we can count the frequency of occurrence of each Integer (in that small range) and then loop through that small range to output the items in sorted order.
0 kommentar(er)
