Programming exercises

I didn't use any built-in sort functions here (either)

Python3:

Spoiler:

PHP Code:

---

def low_char(string):
    low = ''
    
    for char in string:
        
        if low > char or low == '':
            low = char
    
    return low

def sort(string):
    new = ''
    
    for i in range(len(string)):
        new_char = str(low_char(string))
        f = string.find(new_char)
        
        new = str(new) + new_char
        string = string[0:f]+string[f+1:]
    
    return new
#ragezone => aeegnorz and RaGEZONE => EEGNORZa
#convert to lower to sort by actual letter
print(sort(input('Enter a string:\n'))) 


---

C++ without built-in sort()

Spoiler:

PHP Code:

---

#include <iostream>
#include <string.h>
using namespace std;


char low_char(char str[], int len)
{
    char low[1], c[1];
    
    for(int i = 0; i < len; i++)
    {
        *c = str[i];
        
        if(memcmp(c, low, 256) < 0 or strlen(low) == 0)
        {
            *low = str[i];
        }
    }
    
    return low[0];
}


char* sort(char s[])
{
    string n;
    char * c, * result;
    
    string str = s;
    int total = str.length();
    
    for(int i = 0; i < total; i++)
    {
        int len = str.length();
        
        c = new char [len+1];
        strcpy(c, str.c_str());
        
        char new_char[1] = {low_char(c, len)};
        int f = str.find(new_char);
        
        n.append(new_char);
        str = str.substr(0, f) + str.substr(f+1);
    }
    
    result = new char[n.size()+1];
    strcpy(result, n.c_str());
    
    return result;
}


int main()
{
    char test[255];
    
    cout << "Enter a string:" << endl;
    cin.getline(test, 255);
    
    int len = strlen(test);
    
    cout << sort(test) << endl;
    
    return 0;
} 


---

C++ with built-in sort():

PHP Code:

---

// string::begin and string::end
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;

int main ()
{
    char input_chars[255];
    cin.getline(input_chars, 255);
    string str(input_chars);
    sort(str.begin(), str.end());
    cout << str << endl;
    return 0;
} 


---

Each of the results (from what I've tested) are exactly the same.

i just tested some codes and i found it cool :)haha

Quote:

---

Originally Posted by FrostElite

Example 2

Alright guys for the next problem you will prompt a user to enter a word then re-arrange the letters to show in alphabetical order

Spoiler:

Input

Code:

---

ragezone

---

Output

Code:

---

aeegnorz

---

---

here's my full algorithm for that...no sort function used and yea..enjoy

PHP Code:

---

private void button1_Click(object sender, EventArgs e)
        {
            List<char> l = new List<char>();
            string cW = "zyxlfndshskepghndearc";

            foreach (char cL in cW)
            {
                l.Add(cL);
            }

            string fnl = wAsc(l);

            MessageBox.Show(fnl);
        }

        private string wAsc(List<char> nL)
        {
            bool move = true;

            do
            {
                move = false;

                for (int i = 0; i < nL.Count - 1; i++)
                {
                    if (Convert.ToInt32(nL[i]) > Convert.ToInt32(nL[i + 1]))
                    {
                        char hold = nL[i];
                        nL[i] = nL[i + 1];
                        nL[i + 1] = hold;

                        move = true;
                    }
                }

            } while (move);

            string aSw = "";

            for (int j = 0; j < nL.Count - 1; j++)
            {
                char tChr = nL[j];
                aSw += tChr.ToString();
            }

            return aSw;
        } 


---

Quote:

---

Originally Posted by FrostElite

Example 2

Alright guys for the next problem you will prompt a user to enter a word then re-arrange the letters to show in alphabetical order

Input

Code:

---

ragezone

---

Output

Code:

---

aeegnorz

---

---

Here's my 1-liner that does the trick :)

Code:

---

Console.WriteLine(new string(Console.ReadLine().ToCharArray().OrderBy(x => x).ToArray()));

---

Exercise 3

Spoiler:

Title: Basic Kinematics
By: Skippy

Wait! Don't freak out! I know this says kinematics, but you aren't required to know any physics to do this activity. Just some algebra and programming skills, thats it. I promise.

Description: In this event you will be writing a program that solves equations. The equation you will be using is
d = vi * t + (1/2) * a * ( t ^ 2 ).
Where d is distance, vi is initial velocity, a is acceleration and t is time.

Since we have one equation with four variables, we are required to know any three variables to solve for the last variable.

This program must effectively:
Get the value of any three variables, then solve for the last variable and display the result. The three known variables must be dynamic. Meaning the user must be able to pick which three variables are known and which one is not known. It is up to you to figure out how to do this.

I am not posting requirements on this one, I want to see how you all decide to get the information from the user and display it back. You can use any method you want, command line arguments, file I/O, or terminal I/O (although all should atleast have terminal out). You can use classes, structures, or just have the whole solution in one function. Do whatever you think is the best way for you to do it. Spend some time on it though, make sure that the user is getting a nice interface and a fully functional program, and I want to read your source so try to keep it neat! Last event's participants did a great job at this.

Advanced:
For those interested in doing advanced functionality, I highly recommend coming up with a solution to this advanced section. Please make sure you code the original program first though, so you can help with other members that might have questions.

The four basic kinematic equations are:
Kinematic Equations and Problem-Solving

d = vi * t + (1/2) * a * t ^ 2
vf ^ 2 = vi ^ 2 + 2 * a * d
vf = vi + a * t
d = ( t / 2 ) * ( vi + vf )

where
d = distance
vi = initial velocity
vf = final velocity
t = time
a = acceleration

Notice that using these four equations, only one new variable was added (vf) yet 3 new functions were added. Also notice how each equation differs from all the others by exactly one variable.

d = vi * t + (1/2) * a * t ^ 2
d, vi, t, a
vf ^ 2 = vi ^ 2 + 2 * a * d
d, vi, vf, a
vf = vi + a * t
vf, vi, a, t
d = ( t / 2 ) * ( vi + vf )
d, vi, vf, a

With this new set of equations, the user can know exactly any three variables and solve for any other variable. So Instead of knowing three variables and solving for one unknown, a physicist can know three variables and solve for both unknowns.

Well in order to do this, the value obtained as the result of one equation will then be used in a different equation, etc.

For example lets say that we know d, vi, and a.

the program then needs to solve for t and vf.

since equation 1 has the three given values and t, t can be solved for in equation one.

Now the program can use any other equation to solve for vf.