User contributions
7 January 2023
6 January 2023
5 January 2023
3 January 2023
1 January 2023
31 December 2022
29 December 2022
28 December 2022
27 December 2022
26 December 2022
25 December 2022
24 December 2022
22 December 2022
12 December 2022
7 December 2022
6 December 2022
5 December 2022
4 December 2022
3 December 2022
2 December 2022
Practice Everyday
no edit summary
Practice Everyday
no edit summary
Practice Everyday
no edit summary
+1,130
1 December 2022
30 November 2022
29 November 2022
28 November 2022
Practice Everyday
no edit summary
Practice Everyday
no edit summary
+456
User:Eric
Chinese
+11
User:Eric
no edit summary
+38
User:Eric
Read
+7
29 May 2022
C Language Practice: Sorting - Super Quick Sort for 100 million items (Trust me, it works!)
Created page with "== Sorting - Super Quick Sort == '''''How does quick sort work, in the first place?''''' Well, quick sort is another sorting method, and according to its name, it's ''quick''. In fact, it is actually one of the most popular sorting methods amongst them all! But why is it so popular? Because it is ''quick'', and also, it can sort '''huge''' amounts of data, such as this one, ''100 million'' numbers is no problem! But back to the topic, how does quick work? The way it..."
User:Eric
Code
+97
5 April 2022
Recursion
Created page with "== Recursion == Have you ever had a situation where there are two mirrors facing each other? If so, you should've noticed that each mirror have infinite, shrinking images of the other side, right? ''That is recursion!'' Another fun way to explain this is that you got a mysterious box. Someone told you that there's treasure in this box. You found out that there are two boxes in the box. You open one, which is empty. You open the other one, and found two more smaller box..."
C Language Practice: Sorting - Merge Sort
Created page with "== Merge Sort == '''What is merge sort?''' Hooray! We have another way of sorting - merge sort! This type of sorting is pretty fast in my opinion. What we want to do in merge sort(there are also different ways people can understand this. This is only my opinion. You can search for other opinions if you like) is that we start by cutting the list. We cut the list in halves, then we cut the halves into halves, and we cut those halves into halves again and again until ther..."
User:Eric
Code
+47
27 March 2022
Salva's Characteristics
Created page with "Salva is one of the main characters in the book ‘A Long Walk To Water’. He met another character in the end. He also have some great characteristics that I’m going to partly analyze today. Salva always have hope, and he won’t be beaten by anything if he have hope. For example, when his uncle was murdered by people from an enemy tribe, he didn’t end his own life with it. He continued to walk. His once rich family has been broken down into pieces because of the..."
Reading Reflection
Created page with "‘A Long Walk To Water’ is a story about two main characters, one Salva, one Nya. Salva experienced war and Nya met negative effects on life for the drought of Sudan. Salva got a new family in the US but also had some members of his original family. He cherished any chance he met and dug wells for people of Sudan, even his enemies, which included Nya. I agree with what he said: Never Lose Hope. Almost every person who experienced war can say these words, especially S..."
26 March 2022
C Language Practice: Sorting - Insertion Sort
Created page with "== Insertion Sort == '''What is insertion sort?''' We have an easy train of thought for insertion sort, but this sorting method is a bit slow. What we do in insertion sort is we pick up the second element, and we compare it with the first element. Then we pick the next(third) element and we keep comparing it with the elements before it(the second and first) until we meet an element that is smaller or equal to it. We then pick up our third element, move the list behind..."
User:Eric
Code
+51
A long walk to water
Read: A long walk to water
−33
A long walk to water
Created page with "== Read: A long walk to water == Reading Reflection Salva's Characteristics"
User:Eric
Read
+25
25 March 2022
C Language Practice: Sorting - Bubble Sort
Created page with "== Bubble sort == '''What is bubble sort?''' Bubble sort is another way of sorting. Its code is easier than selection sort, and its speed is also faster. What we want to do in bubble sort is that we compare the first two elements, and see if we need to swap it. Then we compare the second and third, then the third and fourth, and so on and so on until we compared the whole list. If we didn't need to swap at all, then the list is sorted and we can return it. If not, go..."
User:Eric
Code
+48
20 March 2022
C Language Practice: Sorting - Selection Sort
Created page with "== One Way for Sorting - Selection Sort == What is selection sort? Selection sort is a kind of sorting. It's the easiest sorting and it also uses most time. To mention here, there are many ways of selection sorting. I'm only going to talk about the way that I see. You can surf the internet and find other ways. There are also two directions you can sort a list: from least to greatest or from greatest to least. Here I uses the least to greatest way. What you want to d..."
User:Eric
Code
+51
C Language Practice: Number Search - Jump Search
Created page with "== A New Skill - Jump Search == What is jump search? Jump search is our new skill. Let's say that there's a number list called array, the total number of elements in array is stored in a variable called total, and the number we're looking for is called check. We'll divide our array into blocks with length m, and then we'll jump to the edge of each block and check if that number is the same as check. Also, as soon as the edge of one block is greater than check, then we'..."
User:Eric
Code
+54
13 March 2022
C Language Practice: Number Search - Binary Search
Created page with "== Search for a Number - Binary Search == * Step 1: Define a number binary search function * Step 2: Get all the arguments needed in main <syntaxhighlight lang="c" line style="border: 1px dashed red;"> #include <stdio.h> #include <stdlib.h> #include <string.h> #include <math.h> int findnum(int totalnum, int numcheck, int numlist[totalnum]) { int i, place = totalnum / 2; for (i = 0; i <= totalnum; i++) { if (numlist[place] == numcheck) {..."
User:Eric
Code
+56