Can anyone please help me understand, how I should bring this ODE
y'' + y = sin(t)
with initial conditions y(0) = 100, y'(0) = 5
into a Runge-Kutta-Form?
I tried to solve this equation, the solution of the homogeneous equation is $$y_{\rm hom} = a + b\,e^{-x}$$ for some constants $a,b$. The particular solution is $y = 0$ (?)
Thank you very much

In order to apply Runge-Kutta methods you need to write the given initial-value problem in the form \begin{eqnarray} \boldsymbol{\dot{y}} &=& \boldsymbol{f}(t,\boldsymbol{y}),\\ \boldsymbol{y}(t_0) &=& \boldsymbol{y}_0, \end{eqnarray} for some time-dependent, vector-valued function $\boldsymbol{y}(t)$. The function $\boldsymbol{f}$, the initial time $t_0$ and the initial value $\boldsymbol{y}_0$ need to be known. Then you can apply some s-stage Runge-Kutta method with parameters $a_{ij}, b_i, c_i$ and with step size $h > 0$: \begin{eqnarray} \boldsymbol{k}_i &=& \boldsymbol{f}\left(t_{n-1} + c_i h, \boldsymbol{y}_{n-1} + h \sum_{j=1}^s a_{ij} \boldsymbol{k}_j \right), \quad i=1,2,\dots,s,\\ \boldsymbol{y}_n &=& \boldsymbol{y}_{n-1} + h \sum_{i=1}^s b_i \boldsymbol{k}_i, \end{eqnarray} for $n=1,2,\dots$, to obtain approximations $\boldsymbol{y}_n \simeq \boldsymbol{y}(t_n)$, where $t_n = t_0 + n h$.
In order to obtain the required form of your problem you define the vector-valued function $\boldsymbol{y} := (y,\dot{y})^{\top}$, and you write using the given ODE: \begin{equation} \boldsymbol{\dot{y}} = \left( \begin{array}{c} \dot{y}\\ \ddot{y} \end{array} \right) = \left( \begin{array}{c} \dot{y}\\ - y + \sin(t) \end{array} \right) =: \boldsymbol{f}(t,\boldsymbol{y}). \end{equation} The initial point $(t_0, \boldsymbol{y}_0)$ is obtained from the given initial conditions: with $t_0 := 0$ you write \begin{equation} \boldsymbol{y}(0) = \left( \begin{array}{c} y(0)\\ \dot{y}(0) \end{array} \right) = \left( \begin{array}{c} 100\\ 5 \end{array} \right) =: \boldsymbol{y}_0. \end{equation} Now you have all the ingredients required in order to solve the problem numerically using a Runge-Kutta method.
This derivation also explains the code given by Max Herrmann, and in his explanation he used some more complicated version of an (embedded) Runge-Kutta method which features automatic step size selection.