Ricardo Vogel ricardovogel

## quicksort.java
  public static void quickSort(int[] elements) {
    quickSort(elements, 0, elements.length - 1);
  }

  public static void quickSort(int[] elements, int low, int high) {
    if(low >= high){
      return;
    }
    int pivot = partition(elements, low, high);
    quickSort(elements, low, pivot - 1);

## TU Delft material.md

      
        
          
            
              
              1 file
            
          
          
            
              
              0 forks
            
          
          
            
              
              0 comments
            
          
          
            
              
              0 stars
            
          
        
        
          
              
          
          
            
                ricardovogel
                / TU Delft material.md
            
            
              Last active
              March 25, 2020 16:13
            
          
        
      
        
  
      
    If you're a TU Delft student, you can contact me to get access to my solutions to exams and assignments. Send an email using your TU Delft address to R.Vogel-1[at]student.tudelft.nl.
Availible material:

OOP Assignments
OOP Exams
ADS Weblab (inc. exams)
	public static void quickSort(int[] elements) {
	quickSort(elements, 0, elements.length - 1);
	}

	public static void quickSort(int[] elements, int low, int high) {
	if(low >= high){
	return;
	}
	int pivot = partition(elements, low, high);
	quickSort(elements, low, pivot - 1);