CareerCup

From my understanding, a dictionary is a set of words, lexically sorted, providing a meaning to the given key/entry in it.

In your case, do you have a list of the "words" and their meanings/values/whatever and need the dictionary for random access of any of the available words?

If that could be the case, I would suggest a hashMap as underlying data structure where key is the word itself.

/**
*Most of the code copied from howtodoinjava dot com site
*
*/

import java.io.File;
import java.io.RandomAccessFile;
import java.nio.MappedByteBuffer;
import java.nio.channels.FileChannel;
 
public class MemoryMappedFileReadExample 
{
    private static String largeCSV = "data3GB.csv";
 
    public static void main(String[] args) throws Exception 
    {
        //Create file object
        File file = new File(largeCSV);
         
        //Get file channel in readonly mode
        FileChannel fileChannel = new RandomAccessFile(file, "r").getChannel();
         
        //Get direct byte buffer access using channel.map() operation
        MappedByteBuffer buffer = fileChannel.map(FileChannel.MapMode.READ_ONLY, 0, fileChannel.size());
         
        // the buffer now reads the file as if it were loaded in memory. 
        System.out.println(buffer.isLoaded());  //prints false
        System.out.println(buffer.capacity());  //Get the size based on content size of file
         
        //You can read the file from this buffer the way you like.
        for (int i = 0; i < buffer.limit(); i++)
        {
           processYourDataIntoDatabase((char) buffer.get());//here do whatever you like in DB
        }
    }
}

iteration through the array actually starts at i=1,but since one may like to see the other differences between elements,I am starting from 0.

#include <iostream>

using namespace std;

void find_max(int arr [], int arr_len){
	int max = arr[1] - arr[0];
	for(int i = 0; i < arr_len - 1; i++ ){
		//cout<< arr[i+1] - arr[i]<<" ";
		if(max < arr[i+1] - arr[i]){
			max = arr[i+1] - arr[i];
			
		}
	}
	
	cout<<endl<<max<<endl;
		return;
}

int main(){
	int arr[] = { 0,6,14,19,20,60,61,70,85,95,100};
	find_max(arr,11);
	return 0;

}